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

%I #6 Jan 31 2020 08:45:20

%S 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,

%T 40,41,15,44,16,47,49,50,18,53,19,56,58,59,21,62,64,65,67,68,24,71,25,

%U 74,76,77,27,80,82,83,85,86,30,89,91,92,94

%N a(n) = (1/2)*(s(n) + 1), where s(n) is the n-th odd number in A026136.

%C Also a(n) = (1/2)*s(n), where s(n) is the n-th even number in A026166.

%H F. M. Dekking, <a href="https://arxiv.org/abs/2001.08915">Permutations of N generated by left-right filling algorithms</a>, arXiv:2001.08915 [math.CO], 2020.

%Y Cf. A026166, A026136.

%K nonn

%O 1,2

%A _Clark Kimberling_

%E Edited by _N. J. A. Sloane_, Jan 31 2020

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 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)