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.
%I A209860 #8 Mar 30 2012 17:23:15 %S A209860 0,1,2,3,4,5,6,7,8,9,10,13,14,15,16,17,18,29,30,31,32,33,34,61,62,63, %T A209860 64,65,66,73,118,125,126,127,128,129,130,148,235,253,254,255,256,257, %U A209860 258,274,493,509,510,511,512,513,514,651,689,710,825,846,884,1021,1022,1023,1024,1025,1026,1097,1974,2045,2046,2047,2048,2049 %N A209860 Fixed points of permutation A209861/A209862. %C A209860 Conjecture: for every a(n), also A054429(a(n)) is in the sequence. Conversely, if i is not in the sequence, then neither is A054429(i). %H A209860 Antti Karttunen, <a href="/A209860/b209860.txt">Table of n, a(n) for n = 0..171</a> %F A209860 Those i, for which A209861(i)=i, or equally A209862(i)=i. %Y A209860 A209863 gives the number of these fixed points in each range [2^(n-1),(2^n)-1]. %K A209860 nonn %O A209860 0,3 %A A209860 _Antti Karttunen_, Mar 24 2012