login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101422 Minimal number of primes needed to sum to Fibonacci(n). 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,4

LINKS

Table of n, a(n) for n=3..107.

FORMULA

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

EXAMPLE

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.

Sequence in context: A319695 A029428 A167866 * A070304 A275308 A233138

Adjacent sequences:  A101419 A101420 A101421 * A101423 A101424 A101425

KEYWORD

nonn

AUTHOR

Giovanni Teofilatto, Jan 17 2005

EXTENSIONS

Edited and extended by Ray Chandler, Jan 18 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 07:13 EDT 2021. Contains 343879 sequences. (Running on oeis4.)