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 A222602 #12 Mar 11 2013 13:40:30 %S A222602 1,1,3,0,2,5,13,55,21,987,8,89,233,377,34,1597,28657,6765,144,610, %T A222602 17711,196418,514229,2584,4181,10946,121393,317811,3524578,46368, %U A222602 1346269,1836311903,75025,5702887,24157817,102334155,165580141,832040,14930352,701408733 %N A222602 Irregular triangle of conjectured Fibonacci numbers with exactly n 0-bits in their binary representation. %H A222602 T. D. Noe, <a href="/A222602/b222602.txt">Rows n = 0..500 of irregular triangle, flattened</a> %e A222602 The irregular triangle begins %e A222602 {1, 1, 3}, %e A222602 {0, 2, 5, 13, 55}, %e A222602 {21, 987}, %e A222602 {8, 89, 233, 377}, %e A222602 {34, 1597, 28657}, %e A222602 {6765}, %e A222602 {144, 610}, %e A222602 {17711, 196418, 514229}, %e A222602 {2584, 4181, 10946, 121393, 317811}, %e A222602 {3524578}, {46368, 1346269, 1836311903}, %e A222602 {75025, 5702887, 24157817, 102334155, 165580141}, %e A222602 {832040, 14930352, 701408733} %t A222602 f = Fibonacci[Range[0,1000]]; Table[Select[f, Count[IntegerDigits[#, 2], 0] == n &], {n, 0, 20}] %Y A222602 Cf. A004685 (Fibonacci numbers in binary), A214853 (one 0-bit), A222601. %Y A222602 Cf. A222295, A222296, A222757, A222758. %K A222602 nonn,tabf %O A222602 0,3 %A A222602 _T. D. Noe_, Mar 08 2013