Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121364
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121364 Convolution of A066983 with the double Fibonacci sequence A103609. +0
1
0, 0, 1, 2, 3, 6, 10, 18, 29, 50, 81, 136, 220, 364, 589, 966, 1563, 2550, 4126, 6710, 10857, 17622, 28513, 46224, 74792, 121160, 196041, 317434, 513619, 831430, 1345282, 2177322, 3522981, 5701290, 9224881, 14927768, 24153636, 39083988 (list; graph; listen)
OFFSET

1,4

COMMENT

The convolution of 1,0,1,1,1,3,3,7,9,17,25,... (A066983 with 1,0 added to the front) with "A double Fibonacci sequence" (A103609) is the Fibonacci sequence (A000045), with an extra initial 0.

FORMULA

a(n) = F(n) - D(n+1), where F is the Fibonacci sequence (A000045), and D is "A double Fibonacci sequence" (A103609)

EXAMPLE

a(7)=10 because F(7)=13 and D(8)=3, and a(7)=F(7)-D(8)

CROSSREFS

Cf. A066983, A103609, A000045.

Sequence in context: A065441 A075531 A066067 this_sequence A102702 A060945 A077930

Adjacent sequences: A121361 A121362 A121363 this_sequence A121365 A121366 A121367

KEYWORD

nonn

AUTHOR

Graeme McRae (g_m(AT)mcraefamily.com), Jul 23 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research