A085856 Number of 2's in decimal expansion of Fibonacci(n).

0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 2, 1, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 0, 2, 0, 0, 0, 0, 2, 1, 1, 3, 1, 2, 1, 3, 1, 2, 2, 2, 3, 1, 1, 1, 1, 2, 0, 2, 2, 3, 0, 1, 2, 1, 0, 1, 1, 2, 1, 1, 4, 2, 1, 1, 0, 0, 3, 2, 2, 0, 0, 2, 0, 1, 3, 4, 0, 2, 3, 1, 4, 3, 0, 3, 3, 5

Offset: 0

Author

Jason Earls, Jul 06 2003

Keywords

• base
• nonn

Examples

			Fibonacci(33) = 3524578, so a(33)=1.
Fibonacci(87) = 679891637638612258, so a(87)=2.
		

Links

• Robert Israel, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. 0's A085854, 1's A085855, 3's A085857, 4's A085858, 5's A085859, 6's A085860, 7's A085861, 8's A085862, 9's A085863.

Programs

Maple

f:= n -> numboccur(2,convert(combinat:-fibonacci(n),base,10)):
map(f, [$0..200]); # Robert Israel, Nov 22 2020

Mathematica

Table[DigitCount[Fibonacci[n]][[2]], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Jul 01 2011 *)