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!)
A209864 a(n) = number of cycles in range [2^(n-1),(2^n)-1] of permutation A209861/A209862. 8

%I #9 Mar 30 2012 17:23:15

%S 1,1,2,4,7,8,11,12,14,10,21,14,20,26,22,18,18,28,23,30,32

%N a(n) = number of cycles in range [2^(n-1),(2^n)-1] of permutation A209861/A209862.

%C a(0) gives the number of cycles in range [0,0], i.e. 1.

%H Antti Karttunen, <a href="/A209864/a209864.txt">Listing showing a more detailed cycle-structure of permutations A209861/A209862 up to n=20.</a>

%Y Cf. A209863, A209865, A209866, A209867.

%K nonn

%O 0,3

%A _Antti Karttunen_, Mar 24 2012

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 17 21:22 EDT 2024. Contains 371767 sequences. (Running on oeis4.)