|
Search: id:A059915
|
|
|
| A059915 |
|
A sequence f(n) of positive integers is called an F-sequence (in memory of Fibonacci) if it satisfies f(0)=0, f(1)=1, f(2)=2 and for all n > 2, either f(n) = f(n-1) + f(n-2) or f(n) = f(n-1) + f(n-3). A positive integer is called an F-number if it occurs in any F-sequence. Sequence gives numbers which are not F-numbers. |
|
+0
1
|
| |
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The sequence given above contains all non-F-numbers up to 5000000 (according to Klaus Nagel (nagel.klaus(AT)t-online.de)).
|
|
EXAMPLE
|
22 IS an F-number because 0,1,2,2,3,5,7,10,15,22,... is an F-sequence. All Fibonacci-numbers are F-numbers.
|
|
CROSSREFS
|
Sequence in context: A160221 A042024 A141999 this_sequence A059701 A036494 A139175
Adjacent sequences: A059912 A059913 A059914 this_sequence A059916 A059917 A059918
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Christian Wieschebrink (wieschebrink(AT)t-online.de), Feb 28 2001
|
|
|
Search completed in 0.002 seconds
|
