Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023489
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023489 a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or is not a Fibonacci number). +0
1
5, 11, 17, 25, 38, 57, 87, 135, 213, 337, 537, 860, 1382, 2226, 3591, 5800, 9372, 15151, 24501, 39629, 64106, 103710, 167790, 271473, 439235, 710679, 1149884, 1860532, 3010384, 4870883, 7881233, 12752081, 20633278, 33385322 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Sequence in context: A049755 A096449 A089110 this_sequence A108294 A046869 A028388

Adjacent sequences: A023486 A023487 A023488 this_sequence A023490 A023491 A023492

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research