The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A222296 Irregular triangle read by rows: row n lists the Fibonacci numbers with exactly n 1's in their binary representation. 5

%I #63 Feb 16 2020 20:10:32

%S 0,1,1,2,8,3,5,34,144,13,21

%N Irregular triangle read by rows: row n lists the Fibonacci numbers with exactly n 1's in their binary representation.

%C Besides those listed in Example section, there are no additional terms with small number of 1's in the first 10^12 Fibonacci numbers. In particular, if A000120(Fibonacci(n)) < 100, then n <= 319 or n > 10^12. - _Charles R Greathouse IV_, Mar 06 2014

%C For the theorem about S-units that Noam Elkies quotes (in the MathOverflow link), see Chapter 1 of Storey-Tijdemann, 1986. - _N. J. A. Sloane_, Jan 28 2017

%D T. N. Shorey and R. Tijdeman, Exponential Diophantine Equations, Cambridge Tracts in Mathematics, 1986.

%H Charles Greathouse and Noam D. Elkies, <a href="http://mathoverflow.net/questions/159142">Hamming weight of Fibonacci numbers</a>, MathOverflow, 2014

%H Charles Greathouse and Noam D. Elkies, <a href="/A222296/a222296.pdf">Hamming weight of Fibonacci numbers</a>, MathOverflow, 2014 [Cached copy of three screen shots]

%H T. D. Noe, <a href="/A222296/a222296.txt">Conjectured values for rows n = 0..500 of irregular triangle, flattened</a>

%H David Terr, <a href="http://www.fq.math.ca/Scanned/34-4/terr.pdf">On the sums of digits of Fibonacci numbers,</a> Fibonacci Quarterly 34, Aug. 1996, pp. 349-355.

%e The irregular table begins

%e {0},

%e {1, 1, 2, 8},

%e {3, 5, 34, 144},

%e {13, 21, ...}.

%e It is conjectured that the previous (n=3) row is complete, and that the subsequent rows are:

%e {89, 610, 2584},

%e {55, 233, 4181},

%e {377, 10946, 46368, 75025},

%e {1597},

%e {987, 6765, 17711, 832040},

%e {121393, 2178309},

%e {39088169},

%e {28657, 196418, 317811, 1346269, 9227465},

%e {514229, 5702887, 14930352, 63245986, 4807526976},

%e {3524578, 2971215073}

%e ...

%t f = Fibonacci[Range[0,100]]; Table[Select[f, Total[IntegerDigits[#, 2]] == n &], {n, 0, 20}]

%o (PARI) row(n)=my(k=-1,t); while(1,t=fibonacci(k++); if(hammingweight(t)==n, print1(t", "))) \\ _Charles R Greathouse IV_, Mar 04 2014

%Y Cf. A004685 (Fibonacci numbers in binary), A221158 (weight 2), A222295, A222601, A222602, A222757, A222758.

%K nonn,base,tabf,more,hard

%O 0,4

%A _T. D. Noe_, Feb 22 2013

%E a(9)-a(10) from _Noam D. Elkies_, via _Charles R Greathouse IV_, Mar 04 2014

%E Truncated to established terms by _Max Alekseyev_, May 13 2014

%E Edited by _Max Alekseyev_, Sep 08 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 18:59 EDT 2024. Contains 372765 sequences. (Running on oeis4.)