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!)
A026182 a(n) = (1/2)*(s(n) + 1), where s(n) is the n-th odd number in A026136. 4
1, 2, 4, 5, 3, 8, 10, 11, 13, 14, 6, 17, 7, 20, 22, 23, 9, 26, 28, 29, 31, 32, 12, 35, 37, 38, 40, 41, 15, 44, 16, 47, 49, 50, 18, 53, 19, 56, 58, 59, 21, 62, 64, 65, 67, 68, 24, 71, 25, 74, 76, 77, 27, 80, 82, 83, 85, 86, 30, 89, 91, 92, 94 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Also a(n) = (1/2)*s(n), where s(n) is the n-th even number in A026166.
LINKS
F. M. Dekking, Permutations of N generated by left-right filling algorithms, arXiv:2001.08915 [math.CO], 2020.
CROSSREFS
Sequence in context: A105529 A329454 A120237 * A026198 A026206 A353708
KEYWORD
nonn
AUTHOR
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:03 EDT 2024. Contains 371794 sequences. (Running on oeis4.)