cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A308002 a(n) = smallest nonnegative number that requires n applications of the modified Sisyphus function x -> A171797(x) to reach 312.

Original entry on oeis.org

312, 101, 0, 11, 10000000000111111111
Offset: 0

Views

Author

N. J. A. Sloane, May 12 2019

Keywords

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.

Examples

			0 -> 110 -> 312 reaches 312 in two steps, so a(2) = 0.
		

References

  • M. E. Coppenbarger, Iterations of a modified Sisyphus function, Fib. Q., 56 (No. 2, 2018), 130-141.

Crossrefs