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 A222758 #4 Mar 11 2013 14:20:51 %S A222758 0,1,2,3,6,4,5,9,12,7,8,11,15,18,10,13,19,14,21,24,25,17,16,20,22,30, %T A222758 26,32,38,23,27,28,31,35,29,34,36,39,48,33,47,37,42,45,68,40,43,54,57, %U A222758 60,41,51,52,53,44,49,50,61,66,59,64,46,56,55,71,77 %N A222758 Irregular table of conjectured indices of Fibonacci numbers with exactly n 1-bits in their binary representation. %C A222758 Every nonnegative integer appears. %H A222758 T. D. Noe, <a href="/A222758/b222758.txt">Rows n = 0..1000 of irregular triangle, flattened</a> %e A222758 The irregular table begins %e A222758 {0}, %e A222758 {1, 2, 3, 6}, %e A222758 {4, 5, 9, 12}, %e A222758 {7, 8}, %e A222758 {11, 15, 18}, %e A222758 {10, 13, 19}, %e A222758 {14, 21, 24, 25}, %e A222758 {17}, %e A222758 {16, 20, 22, 30}, %e A222758 {26, 32}, %e A222758 {38}, %e A222758 {23, 27, 28, 31, 35} %t A222758 nn = 100; f = Fibonacci[Range[0, nn]]; t2 = Transpose[{Range[0, nn], f}]; Table[Select[Range[nn + 1], Count[IntegerDigits[t2[[#, 2]], 2], 1] == n &] - 1, {n, 0, nn/5}] %Y A222758 Cf. A004685 (Fibonacci numbers in binary), A222601, A222602, A222757. %K A222758 nonn,tabf %O A222758 0,3 %A A222758 _T. D. Noe_, Mar 11 2013