login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022800 a(n) = F(n+2) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or is a non-Fibonacci number. 0
3, 7, 11, 15, 22, 31, 45, 67, 103, 159, 249, 394, 628, 1006, 1617, 2606, 4204, 6789, 10971, 17737, 28684, 46396, 75054, 121423, 196449, 317843, 514262, 832075, 1346305, 2178346, 3524616, 5702926, 9227505 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

CROSSREFS

Sequence in context: A170888 A182838 A163094 * A071849 A165197 A160785

Adjacent sequences:  A022797 A022798 A022799 * A022801 A022802 A022803

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 18 12:20 EDT 2013. Contains 225419 sequences.