A102106 -id:A102106 - cp's OEIS frontend

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

Giovanni Teofilatto, Jan 17 2005

nonn

			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.

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

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

Edited and extended by Ray Chandler, Jan 18 2005

A102107 Indices of Fibonacci numbers that can be expressed as the sum of three (but no fewer) primes.

Original entry on oeis.org

14, 16, 19, 22, 25, 26, 28, 31, 32, 34, 35, 37, 38, 40, 41, 44, 46, 49, 50, 52, 53, 55, 56, 58, 59, 61, 62, 64, 65, 67, 68, 70, 71, 73, 74, 76, 77, 79, 80, 82, 85, 86, 88, 89, 91, 92, 94, 95, 97, 98, 101, 103, 104, 107, 109, 110, 112, 113, 115, 116, 118, 119, 121, 122

Offset: 1

Ray Chandler, Jan 18 2005

nonn

k is a term iff A101422(k)=3.

Cf. A101422, A001605, A102106.

cp's OEIS Frontend

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

Views

Author

Keywords

Examples

Crossrefs

Formula

Extensions

A102107 Indices of Fibonacci numbers that can be expressed as the sum of three (but no fewer) primes.

Views

Author

Keywords

Comments

Crossrefs