PROG
for n in xrangerange(1, 21): print [t(n, k) for k in xrangerange(1, n + 1)][::-1] # Indranil Ghosh, May 08 2017
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A286248
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
STATUS
proposed
approved
STATUS
editing
proposed
PROG
def P(n):
f = factorint(n)
def P(n): return sorted([factorint(n)f[i] for i in factorint(n)f])
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
PROG
for n in xrange(1, 21): print [t(n, k) for k in xrange(1, n + 1)][::-1] # _Indranil Ghosh_, May 08 2017
PROG
(Python)
from sympy import factorint
import math
def T(n, m): return ((n + m)**2 - n - 3*m + 2)/2
def P(n): return sorted([factorint(n)[i] for i in factorint(n)])
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 xrange(1, 21): print [t(n, k) for k in xrange(1, n + 1)][::-1]
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed