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.

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

This page as a plain text file.
%I A209864 #9 Mar 30 2012 17:23:15
%S A209864 1,1,2,4,7,8,11,12,14,10,21,14,20,26,22,18,18,28,23,30,32
%N A209864 a(n) = number of cycles in range [2^(n-1),(2^n)-1] of permutation A209861/A209862.
%C A209864 a(0) gives the number of cycles in range [0,0], i.e. 1.
%H A209864 Antti Karttunen, <a href="/A209864/a209864.txt">Listing showing a more detailed cycle-structure of permutations A209861/A209862 up to n=20.</a>
%Y A209864 Cf. A209863, A209865, A209866, A209867.
%K A209864 nonn
%O A209864 0,3
%A A209864 _Antti Karttunen_, Mar 24 2012