Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023499
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023499 a(n) = b(n) + d(n), where b(n) = ( (n+1)st Fibonacci number) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number). +0
1
2, 4, 6, 10, 14, 21, 30, 44, 67, 102, 158, 248, 393, 627, 1006, 1617, 2605, 4203, 6788, 10970, 17736, 28683, 46395, 75053, 121423, 196449, 317843, 514262, 832074, 1346304, 2178345, 3524615, 5702925, 9227504, 14930392, 24157858 (list; graph; listen)
OFFSET

0,1
CROSSREFS

Sequence in context: A082380 A136460 A000065 this_sequence A103445 A001747 A048670

Adjacent sequences: A023496 A023497 A023498 this_sequence A023500 A023501 A023502

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 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.