OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
For example: 7 = 5 + 2; 2 and 5 are Fibonacci numbers which are prime.
MAPLE
fibprimes:= select(isprime, [2, 3, seq(combinat:-fibonacci(ithprime(i)), i=3..100)]):
S:= expand(mul(1+x^p, p = fibprimes[1..11])):
sort(convert(map2(op, 2, indets(S, `^`)), list)): # Robert Israel, Jul 16 2015
MATHEMATICA
PROG
(C) #include <stdio.h>
#define MAX_FIB 6
#define MAX_CALC 2580
int main() {
int fibs[] = {2, 3, 5, 13, 89, 233, 1597};
int num = 0;
int x = 0;
int index = 0;
for(x=1; x<MAX_CALC; x++) {
num = x;
for(index=MAX_FIB; index>-1; index--)
if(fibs[index]<=num) num-=fibs[index];
if(num==0) printf("%d, ", x);
}
printf("\n");
return 0;
}
CROSSREFS
KEYWORD
nonn
AUTHOR
Jose Manuel Hernandez Jr. (j.hernandez38(AT)umiami.edu), Apr 14 2009
EXTENSIONS
Name corrected by T. D. Noe, Apr 15 2009
STATUS
approved