Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A022809
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A022809 a(n) = F(n+3) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or 2 or is not a Fibonacci number. +0
1
4, 7, 12, 19, 28, 43, 65, 100, 156, 247, 392, 626, 1004, 1615, 2603, 4201, 6787, 10969, 17735, 28682, 46394, 75052, 121421, 196447, 317841, 514260, 832072, 1346302, 2178344, 3524614, 5702924, 9227503 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A007333 A097536 A117950 this_sequence A020732 A117949 A010901

Adjacent sequences: A022806 A022807 A022808 this_sequence A022810 A022811 A022812

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 September 5 01:44 EDT 2008. Contains 143476 sequences.


AT&T Labs Research