cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A209863 #7 Mar 30 2012 17:23:15
%S A209863 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 A209863 a(n) = Number of fixed points of permutation A209861/A209862 in range [2^(n-1),(2^n)-1].
%C A209863 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 A209863 Antti Karttunen, <a href="/A209863/b209863.txt">Table of n, a(n) for n = 0..24</a>
%Y A209863 A209860, A209864, A209865, A209866, A209867.
%K A209863 nonn
%O A209863 0,3
%A A209863 _Antti Karttunen_, Mar 24 2012