Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A286248 Triangle A286249 reversed. 2
1, 2, 3, 4, 0, 3, 7, 0, 5, 10, 11, 0, 0, 0, 3, 16, 0, 0, 8, 5, 21, 22, 0, 0, 0, 0, 0, 3, 29, 0, 0, 0, 12, 0, 14, 36, 37, 0, 0, 0, 0, 0, 8, 0, 10, 46, 0, 0, 0, 0, 17, 0, 0, 5, 21, 56, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 67, 0, 0, 0, 0, 0, 23, 0, 12, 19, 27, 78, 79, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 92, 0, 0, 0, 0, 0, 0, 30, 0, 0, 0, 0, 5, 21, 106, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 8, 0, 21 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
See A286249.
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10585; the first 145 rows of triangle/antidiagonals of array
FORMULA
T(n,k) = A286249(k,n).
PROG
(Scheme) (define (A286248 n) (A286249tr (A002024 n) (A004736 n))) ;; For A286249tr, see A286249.
(Python)
from sympy import factorint
import math
def T(n, m): return ((n + m)**2 - n - 3*m + 2)/2
def P(n):
f = factorint(n)
return sorted([f[i] for i in f])
def a046523(n):
x=1
while True:
if P(n) == P(x): return x
else: x+=1
def t(n, k): return 0 if n%k!=0 else T(a046523(n/k), k)
for n in range(1, 21): print [t(n, k) for k in range(1, n + 1)][::-1] # Indranil Ghosh, May 08 2017
CROSSREFS
Transpose: A286249 (triangle reversed).
Sequence in context: A162593 A279125 A011025 * A286247 A203571 A199511
Adjacent sequences: A286245 A286246 A286247 * A286249 A286250 A286251
KEYWORD
nonn,tabl
AUTHOR
Antti Karttunen, May 06 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 12:13 EDT 2024. Contains 375269 sequences. (Running on oeis4.)