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!)
A229830 Trajectory of 1 under the morphism 1 -> 12, 2 -> 1232, 3 -> 123432, 4 -> 12345432, etc. 1
1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, 2, 1, 2, 3, 4, 5, 4, 3, 2, 1, 2, 3, 4, 3, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
It appears that records occur at A000111. [This is false. - Rémy Sigrist, Nov 15 2018]
The n-th local maximum equals a(n) + 1. - Rémy Sigrist, Nov 13 2018
Records at {1, 2, 5, 16, 61, 258, 1161, 5440, 26233, 129282, 648141, 3294864, ...}, which seems to match A104858. - Michael De Vlieger, Nov 13 2018
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..8558 (7 iterations)
MATHEMATICA
With[{n = 5}, Take[#, LengthWhile[#, # <= n &] + 1] &@ Nest[Flatten[# /. Array[Last@ # - 1 -> Most[#~Join~Reverse@ Most@ #] &@ Range@ # &, Max@ #, 2]] &, {1}, n]] (* Michael De Vlieger, Nov 13 2018 *)
PROG
(PARI) a = vector(87); a[1]=1; n=0; for (p=1, oo, h=1+a[p]; for (v=1, h, a[n++]=v; print1 (v ", "); if (n==#a, break (2))); forstep (v=h-1, 2, -1,
a[n++]=v; print1 (v ", "); if (n==#a, break (2)))) \\ Rémy Sigrist, Nov 13 2018
CROSSREFS
Sequence in context: A018194 A338630 A286281 * A105203 A317952 A059131
KEYWORD
nonn
AUTHOR
EXTENSIONS
Data corrected by Rémy Sigrist, Nov 13 2018
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 April 25 10:43 EDT 2024. Contains 371967 sequences. (Running on oeis4.)