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!)
A306155 a(n) > a(n-1) is the smallest number such that a(n)! contains a(n-1)! as a substring, with a(0) = 0. 0
0, 1, 5, 14, 179472 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
a(2)=5 and 5! = 120 is a substring of 14! = 8717829(120)0. Therefore, a(3) is 14.
MATHEMATICA
a[0]=0;
a[n_]:=Module[{k=a[n-1]+1}, While[StringPosition[ToString[k!], ToString[a[n-1]!]]=={}, k++]; k];
a/@Range[0, 3]
CROSSREFS
Cf. A000142.
Sequence in context: A156219 A000331 A353610 * A082269 A367030 A107776
KEYWORD
nonn,base,more,bref
AUTHOR
Ivan N. Ianakiev, Jun 23 2018
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 May 4 14:31 EDT 2024. Contains 372243 sequences. (Running on oeis4.)