The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308002 a(n) = smallest nonnegative number that requires n applications of the modified Sisyphus function x -> A171797(x) to reach 312. 6
 312, 101, 0, 11, 10000000000111111111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS The next term, a(5), is 1 0^1000099 1^100010, a number with 1100110 digits, and is too large to display here. a(n) = index of first n in A100961. REFERENCES M. E. Coppenbarger, Iterations of a modified Sisyphus function, Fib. Q., 56 (No. 2, 2018), 130-141. LINKS Table of n, a(n) for n=0..4. EXAMPLE 0 -> 110 -> 312 reaches 312 in two steps, so a(2) = 0. CROSSREFS Cf. A100961, A171797. Sequence in context: A305546 A071644 A139638 * A112542 A238099 A259720 Adjacent sequences: A307999 A308000 A308001 * A308003 A308004 A308005 KEYWORD nonn,base AUTHOR N. J. A. Sloane, May 12 2019 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.

Last modified May 22 19:06 EDT 2024. Contains 372758 sequences. (Running on oeis4.)