login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026141 a(n) = (s(n)-s(n-1))/2, where s = A026139. 2
1, 2, 1, 3, 2, 1, 2, 1, 3, 3, 2, 1, 3, 2, 1, 2, 1, 3, 2, 1, 2, 1, 3, 3, 2, 1, 3, 3, 2, 1, 3, 2, 1, 2, 1, 3, 3, 2, 1, 3, 2, 1, 2, 1, 3, 2, 1, 2, 1, 3, 3, 2, 1, 3, 2, 1, 2, 1, 3, 2, 1, 2, 1, 3, 3, 2, 1, 3, 3, 2, 1, 3, 2, 1, 2, 1, 3, 3, 2, 1, 3, 3, 2, 1, 3, 2, 1, 2, 1, 3, 3, 2, 1, 3, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

LINKS

Table of n, a(n) for n=2..97.

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

CROSSREFS

Sequence in context: A193865 A026171 A026176 * A089209 A153359 A240474

Adjacent sequences:  A026138 A026139 A026140 * A026142 A026143 A026144

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Edited by N. J. A. Sloane, Jan 31 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 10:04 EDT 2020. Contains 334825 sequences. (Running on oeis4.)