login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A336401
a(n) = a(n-1) concatenated with the smallest number k, such that a(n) is divisible by lcm(1..n).
1
1, 10, 102, 1020, 10200, 102000, 102000360, 1020003600, 10200036001680, 102000360016800, 10200036001680035280, 102000360016800352800, 102000360016800352800332640, 1020003600168003528003326400
OFFSET
1,2
PROG
(PARI) a(n)={if(n==1, return(1)); for(n1=0, oo, k=eval(concat(Str(a(n-1)), n1)); n2=0; for(n3=1, n, if(k%n3==0, n2+=1; if(n2==n, return(k)))))};
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Eder Vanzei, Jul 20 2020
STATUS
approved