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.

A176187 Least period of sequence {f^(m)(n)},m=1,2,3,..., where f^(m) is the m-th iteration of A002326 (f^(1)=f), after possibly dropping some finite number of iterations.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 3, 1, 1, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 3, 1, 1, 3, 1, 3, 1, 3, 1, 1, 3, 1, 1, 1, 3, 1, 3, 3, 1, 1, 1, 3, 3, 3, 1, 1, 3, 3, 1, 3, 1, 3, 1, 3, 3, 1, 3, 1, 3, 3, 1, 1, 1, 3
Offset: 0

Views

Author

Vladimir Shevelev, Apr 11 2010, Apr 20 2010

Keywords

Comments

Conjecture: For every n>=0 the sequence {f^(m)(n)} is eventually periodic. Further calculations may show if there exist terms different from 1 and 3.

Examples

			For n=0, we have: f(0)=1, f(1)=2, f(2)=4, f(4)=6, f(6)=12, f(12)=20, f(20)=20,... Thus a(1)=1.
		

Crossrefs