

A059915


A sequence f(n) of positive integers is called an Fsequence (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(n1) + f(n2) or f(n) = f(n1) + f(n3). A positive integer is called an Fnumber if it occurs in any Fsequence. Sequence gives numbers which are not Fnumbers.


0




OFFSET

0,1


COMMENTS

The sequence given above contains all nonFnumbers up to 5000000 (according to Klaus Nagel (nagel.klaus(AT)tonline.de)).


LINKS

Table of n, a(n) for n=0..5.


EXAMPLE

22 IS an Fnumber because 0,1,2,2,3,5,7,10,15,22,... is an Fsequence. All Fibonaccinumbers are Fnumbers.


CROSSREFS

Sequence in context: A160221 A042024 A141999 * A059701 A226680 A307660
Adjacent sequences: A059912 A059913 A059914 * A059916 A059917 A059918


KEYWORD

hard,more,nonn


AUTHOR

Christian Wieschebrink (wieschebrink(AT)tonline.de), Feb 28 2001


STATUS

approved



