Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078643
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078643 Numbers with exactly one representation as the sum of two Fibonacci numbers. +0
1
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; listen)
OFFSET

1,1

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: A039019 A047255 A062062 this_sequence A137698 A063743 A144100

Adjacent sequences: A078640 A078641 A078642 this_sequence A078644 A078645 A078646

KEYWORD

nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Dec 12 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research