Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023500
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023500 a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number). +0
1
3, 5, 8, 13, 19, 29, 43, 65, 101, 157, 247, 392, 626, 1004, 1616, 2604, 4202, 6787, 10969, 17735, 28682, 46394, 75052, 121421, 196448, 317842, 514261, 832073, 1346303, 2178344, 3524614, 5702924, 9227503, 14930391, 24157857, 39088210 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Sequence in context: A053651 A104563 A030762 this_sequence A035421 A035424 A099351

Adjacent sequences: A023497 A023498 A023499 this_sequence A023501 A023502 A023503

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research