Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115339
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115339 a(2n-1)=F(n+1), a(2n)=L(n), where F(n) and L(n) are the Fibonacci and the Lucas sequences. +0
2
1, 1, 2, 3, 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; listen)
OFFSET

1,3

COMMENT

Alternate Fibonacci and Lucas sequence respecting their natural order.

See A116470 for an essentially identical sequence.

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

a(n+2)=a(n)+a(n-2).

MATHEMATICA

f[n_] := If[OddQ@n, Fibonacci[(n + 3)/2], Fibonacci[n/2 - 1] + Fibonacci[n/2 + 1]]; Array[f, 50] (* Robert G. Wilson v *)

CROSSREFS

Cf. A000045, A000032.

Sequence in context: A125616 A141472 A029034 this_sequence A036019 A018120 A094979

Adjacent sequences: A115336 A115337 A115338 this_sequence A115340 A115341 A115342

KEYWORD

easy,nonn

AUTHOR

Giuseppe Coppoletta (gcoverest-11(AT)yahoo.fr), Mar 06 2006

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Apr 29 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research