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.

A075102 Number of steps to reach the first integer starting with 2^n/n and iterating the map x->x*ceiling(x), or -1 if no integer is ever reached.

Original entry on oeis.org

0, 0, 1, 0, 2, 5, 5, 0, 2, 4, 1, 1, 13, 12, 3, 0, 19, 3, 4, 8, 10, 11, 20, 1, 7, 1, 3, 8, 12, 1, 2, 0, 20, 6, 4, 7, 8, 23, 39, 1, 21, 8, 13, 16, 4, 1, 9, 7, 1, 6, 23, 30, 73, 6, 3, 14, 7, 7, 20, 12, 228, 16, 3, 0, 10, 5, 96, 3, 4, 13, 28, 3, 72, 57, 7, 9, 6, 6
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 02 2002

Keywords

Comments

The starting value is A075101(n)/A000265(n).

Examples

			a(5)=2 since (2^5)/5 = 32/5 -> 224/5 -> 2016 = A075103(5).
		

Crossrefs

Extensions

More terms from Jinyuan Wang, Jan 15 2022