login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116470 All distinct Fibonacci and Lucas numbers. 2
0, 1, 2, 3, 4, 5, 7, 8, 11, 13, 18, 21, 29, 34, 47, 55, 76, 89, 123, 144, 199, 233, 322, 377, 521, 610, 843, 987, 1364, 1597, 2207, 2584, 3571, 4181, 5778, 6765, 9349, 10946, 15127, 17711, 24476, 28657, 39603, 46368, 64079, 75025, 103682, 121393, 167761 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

See A115339 for an essentially identical sequence.

FORMULA

a(0) = 0, a(1) = 1, a(2) = 2, a(3) = 3, a(4) = 4, a(5) = 5, a(6) = 7, a(n) = a(n-2) + a(n-4) for n>6. a(2n) = Lucas[n+1] = Fibonacci[n] + Fibonacci[n+2] for n>1. a(2n+1) = Fibonacci[n+3] for n>2.

G.f.:-x*(x^2+x+1)*(x^3+x+1)/(-1+x^4+x^2) [From Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009]

CROSSREFS

Union of A000045 and A000032.

Sequence in context: A080655 A199120 A118083 * A115649 A191168 A191166

Adjacent sequences:  A116467 A116468 A116469 * A116471 A116472 A116473

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Aug 13 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 03:18 EST 2012. Contains 205978 sequences.