login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078643 Numbers with exactly one representation as the sum of two Fibonacci numbers. 0
2, 3, 5, 7, 8, 9, 11, 13, 14, 15, 18, 21, 22, 23, 24, 29, 34, 35, 36, 37, 39, 47, 55, 56, 57, 58, 60, 63, 76, 89, 90, 91, 92, 94, 97, 102, 123, 144, 145, 146, 147, 149, 152, 157, 165, 199, 233, 234, 235, 236, 238, 241, 246, 254, 267, 322, 377, 378, 379, 380, 382, 385 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..62.

EXAMPLE

1000 has exactly one representation as the sum of Fibonacci numbers: 1000 = 13 + 987. Hence 1000 belongs to the sequence.

MATHEMATICA

r = {}; f = Table[Fibonacci[n], {n, 1, 20}]; FibQ[n_] := MemberQ[f, n]; g[n_] := Module[{a, i}, a = {}; u = Floor[n/2]; For[i = 1, i <= u, i++, If[FibQ[i] && FibQ[n - i], a = Append[a, {n, i, n - i}]]]; a]; For[i = 1, i <= 10^3, i++, If[Length[g[i]] == 1, r = Append[r, i]]]; r

CROSSREFS

Sequence in context: A047255 A062062 A256133 * A137698 A063743 A353968

Adjacent sequences:  A078640 A078641 A078642 * A078644 A078645 A078646

KEYWORD

nonn

AUTHOR

Joseph L. Pe, Dec 12 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 4 08:55 EDT 2022. Contains 357239 sequences. (Running on oeis4.)