|
Search: id:A159556
|
|
|
| A159556 |
|
Numbers n that are the sum of distinct Fibonacci primes. |
|
+0
1
|
|
| 2, 3, 5, 7, 8, 10, 13, 15, 16, 18, 20, 21, 23, 89, 91, 92, 94, 96, 97, 99, 102, 104, 105, 107, 109, 110, 112, 233, 235, 236, 238, 240, 241, 243, 246, 248, 249, 251, 253, 254, 256, 322, 324, 325, 327, 329, 330, 332, 335, 337, 338, 340, 342, 343, 345, 1597, 1599, 1600
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
For example: 7 = 5 + 2; 2 and 5 are Fibonacci numbers which are prime.
|
|
MATHEMATICA
|
Union[Plus@@@Subsets[{2, 3, 5, 13, 89, 233, 1597}]] [From T. D. Noe (noe(AT)sspectra.com), Apr 16 2009]
fibPrime={2, 3, 5, 13, 89, 233, 1597}; t=Rest[CoefficientList[Series[Product[1+x^fibPrime[[k]], {k, Length[fibPrime]}], {x, 0, fibPrime[[ -1]]}], x]]; Flatten[Position[t, _?(#>0&)]] [From T. D. Noe (noe(AT)sspectra.com), Apr 15 2009]
|
|
PROGRAM
|
(Other) #include <stdio.h> #include <stdlib.h> #define MAX_FIB 6 #define MAX_CALC 2580 /** * Outputs the numbers which each fibonacci factoriaztion is a fibonacci prime * in a certain range. */ 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; //Check if it will result in a number which can be expressed in //prime fibonacci sequences. for(index=MAX_FIB; index>-1; index--) { if(fibs[index]<=num) { //Subtract it from total num-=fibs[index]; } } if(num==0) { printf("%d, ", x); } } }
|
|
CROSSREFS
|
Expressed as a sum of unique numbers in A005478.
Sequence in context: A001912 A083027 A060107 this_sequence A028728 A028743 A106735
Adjacent sequences: A159553 A159554 A159555 this_sequence A159557 A159558 A159559
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jose Manuel Hernandez Jr. (j.hernandez38(AT)umiami.edu), Apr 14 2009
|
|
EXTENSIONS
|
Name corrected by T. D. Noe (noe(AT)sspectra.com), Apr 15 2009
|
|
|
Search completed in 0.002 seconds
|
