|
| |
|
|
A011373
|
|
Number of 1's in binary expansion of Fibonacci(n).
|
|
2
| |
|
|
0, 1, 1, 1, 2, 2, 1, 3, 3, 2, 5, 4, 2, 5, 6, 4, 8, 7, 4, 5, 8, 6, 8, 11, 6, 6, 9, 11, 11, 12, 8, 11, 9, 13, 12, 11, 12, 14, 10, 12, 16, 17, 14, 16, 18, 15, 21, 13, 12, 18, 18, 17, 17, 17, 16, 22, 21, 16, 24, 20, 16, 19, 26, 23, 20, 25, 19, 26, 15, 23, 23, 22, 25, 27, 24, 23, 23, 22
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=0..1000
|
|
|
MAPLE
| A000120 := proc(n) add(d, d=convert(n, base, 2)) ; end proc:
A011373 := proc(n) A000120(combinat[fibonacci](n)) ; end proc:
seq(A011373(n), n=0..50) ; # R. J. Mathar, Mar 22 2011
|
|
|
MATHEMATICA
| f[n_]:=Plus@@IntegerDigits[n, 2]; lst={}; Do[fi=Fibonacci[n]; AppendTo[lst, f[fi]], {n, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 10 2009]
DigitCount[#, 2, 1]&/@Fibonacci[Range[0, 80]] (* From Harvey P. Dale, Mar 14 2011 *)
|
|
|
CROSSREFS
| Cf. A059016.
Sequence in context: A097291 A029266 A035387 * A177352 A117915 A097094
Adjacent sequences: A011370 A011371 A011372 * A011374 A011375 A011376
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
