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!)
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 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,10
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.
LINKS
EXAMPLE
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
Sequence in context: A308166 A295931 A295920 * A372288 A180683 A365331
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Apr 11 2010, Apr 20 2010
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 July 30 22:26 EDT 2024. Contains 374771 sequences. (Running on oeis4.)