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!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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
Sequence in context: A045874 A214437 A078282 * A037503 A037680 A038378
KEYWORD
base,nonn
AUTHOR
Eder Vanzei, Jul 20 2020
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 September 2 19:31 EDT 2024. Contains 375616 sequences. (Running on oeis4.)