OFFSET
1,1
COMMENTS
See A285321.
PROG
(Python)
from functools import reduce
from operator import mul
from sympy import prime, primefactors
def a019565(n): return reduce(mul, (prime(i+1) for i, v in enumerate(bin(n)[:1:-1]) if v == '1')) if n > 0 else 1 # This function from Chai Wah Wu
def a007947(n): return 1 if n<2 else reduce(mul, primefactors(n))
def a065642(n):
if n==1: return 1
r=a007947(n)
n = n + r
while a007947(n)!=r:
n+=r
return n
def A(n, k): return a019565(k) if n==1 else a065642(A(n - 1, k))
for n in range(1, 11): print([A(n - k + 1, k) for k in range(1, n + 1)]) # Indranil Ghosh, Apr 19 2017
CROSSREFS
KEYWORD
AUTHOR
Antti Karttunen, Apr 17 2017
STATUS
approved