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!)
A026180 a(n) = s(k), where k is the n-th number such that s(j)<s(k) for all j<k, where s = A026177. 3
1, 4, 10, 12, 16, 22, 28, 30, 34, 36, 40, 46, 48, 52, 58, 64, 66, 70, 76, 82, 84, 88, 90, 94, 100, 102, 106, 108, 112, 118, 120, 124, 130, 136, 138, 142, 144, 148, 154, 156, 160, 166, 172, 174, 178, 184, 190, 192, 196, 198, 202, 208 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
F. M. Dekking, Permutations of N generated by left-right filling algorithms, arXiv:2001.08915 [math.CO], 2020, see R_orec in section 2.3.
CROSSREFS
Cf. A026177.
Sequence in context: A095275 A366530 A117099 * A109274 A071565 A233741
KEYWORD
nonn
AUTHOR
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 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)