Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023502
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023502 a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2 ) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number). +0
1
4, 7, 11, 18, 27, 42, 64, 99, 156, 246, 391, 625, 1003, 1614, 2603, 4201, 6786, 10968, 17734, 28681, 46393, 75051, 121420, 196446, 317841, 514260, 832072, 1346302, 2178343, 3524613, 5702923, 9227502, 14930390, 24157856, 39088209 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Sequence in context: A133257 A156039 A023666 this_sequence A024882 A087203 A109328

Adjacent sequences: A023499 A023500 A023501 this_sequence A023503 A023504 A023505

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