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.

A222758 Irregular table of conjectured indices of Fibonacci numbers with exactly n 1-bits in their binary representation.

Original entry on oeis.org

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, 26, 32, 38, 23, 27, 28, 31, 35, 29, 34, 36, 39, 48, 33, 47, 37, 42, 45, 68, 40, 43, 54, 57, 60, 41, 51, 52, 53, 44, 49, 50, 61, 66, 59, 64, 46, 56, 55, 71, 77
Offset: 0

Views

Author

T. D. Noe, Mar 11 2013

Keywords

Comments

Every nonnegative integer appears.

Examples

			The irregular table begins
{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},
{26, 32},
{38},
{23, 27, 28, 31, 35}
		

Crossrefs

Cf. A004685 (Fibonacci numbers in binary), A222601, A222602, A222757.

Programs

  • Mathematica
    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}]