%I #4 Mar 30 2012 18:40:00
%S 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,
%T 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,
%U 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
%N Minimal number of primes needed to sum to Fibonacci(n).
%F a(n) = A051034(A000045(n)).
%e a(5)=1 because Fibonacci(5)=5 is a prime.
%e a(6)=2 because Fibonacci(6)=8 = 3+5.
%e a(7)=1 because Fibonacci(7)=13 is a prime.
%e a(14)=3 because Fibonacci(14)=377 = 2+2+373.
%Y Cf. A000045, A051034, A001605, A102106, A102107.
%K nonn
%O 3,4
%A _Giovanni Teofilatto_, Jan 17 2005
%E Edited and extended by _Ray Chandler_, Jan 18 2005
|