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!)
A026145 a(n) = s(k), where k is the n-th number such that s(j) < s(k) for all j < k, where s = A026142. Also a(n) = 2*t(n) for n >= 2, where t = A026144. 3
1, 4, 8, 12, 14, 20, 24, 26, 32, 36, 38, 42, 44, 50, 56, 60, 62, 68, 72, 74, 78, 80, 86, 92, 96, 98, 104, 108, 110, 114, 116, 122, 126, 128, 132, 134, 140, 146, 150, 152, 158, 164, 168, 170, 176, 180, 182, 186, 188, 194, 200, 204, 206, 212, 216, 218, 222 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..57.

F. M. Dekking, Permutations of N generated by left-right filling algorithms, arXiv:2001.08915 [math.CO], 2020, see R_rec in section 2.4.

CROSSREFS

Cf. A026142, A026144.

Sequence in context: A311081 A311082 A311083 * A311084 A344957 A192595

Adjacent sequences: A026142 A026143 A026144 * A026146 A026147 A026148

KEYWORD

nonn

AUTHOR

Clark Kimberling

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 January 27 12:05 EST 2023. Contains 359840 sequences. (Running on oeis4.)