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!)
A209863 a(n) = Number of fixed points of permutation A209861/A209862 in range [2^(n-1),(2^n)-1]. 9

%I

%S 1,1,2,4,6,6,6,8,8,8,12,8,10,8,10,6,6,10,8,6,6,10,8,8,6

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

%C See the conjecture given in A209860. If true, then all the terms from a(2) onward are even. a(0) gives the number of fixed points in range [0,0], i.e. 1.

%H Antti Karttunen, <a href="/A209863/b209863.txt">Table of n, a(n) for n = 0..24</a>

%Y A209860, A209864, 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 28 14:58 EDT 2021. Contains 347716 sequences. (Running on oeis4.)