OFFSET
0,1
COMMENTS
Also number of factorizations of 2^6 * Product_{i=1..n} prime(i+1).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..571
PROG
(Python)
from sympy import divisors, isprime, primorial
from functools import cache
@cache
def T(n, m): # after Indranil Ghosh in A001055
if isprime(n): return 1 if n <= m else 0
s = sum(T(n//d, d) for d in divisors(n)[1:-1] if d <= m)
return s + 1 if n <= m else s
def a(n): return (lambda x: T(x, x))(2**5 * primorial(n))
print([a(n) for n in range(1, 11)]) # Michael S. Branicky, Nov 30 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Aug 06 2021
STATUS
approved