A101422 Minimal number of primes needed to sum to Fibonacci(n).

1, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 3, 2, 3, 1, 2, 3, 2, 2, 3, 1, 2, 3, 3, 2, 3, 1, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 1, 3, 2, 3, 1, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 1, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 2, 2, 3, 2, 3, 3, 2, 2, 3

Offset: 3

Author

Giovanni Teofilatto, Jan 17 2005

Keywords

• nonn

Examples

			a(5)=1 because Fibonacci(5)=5 is a prime.
a(6)=2 because Fibonacci(6)=8 = 3+5.
a(7)=1 because Fibonacci(7)=13 is a prime.
a(14)=3 because Fibonacci(14)=377 = 2+2+373.
		

Crossrefs

Cf. A000045, A051034, A001605, A102106, A102107.

Formula

a(n) = A051034(A000045(n)).

Extensions

Edited and extended by Ray Chandler, Jan 18 2005