Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099603
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099603 Row sums of triangle A099602, in which row n equals the inverse binomial transform of column n of the triangle of trinomial coefficients (A027907). +0
3
1, 2, 4, 12, 20, 64, 104, 336, 544, 1760, 2848, 9216, 14912, 48256, 78080, 252672, 408832, 1323008, 2140672, 6927360, 11208704, 36272128, 58689536, 189923328, 307302400, 994451456, 1609056256, 5207015424, 8425127936, 27264286720 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = fibonacci(n+1)*2^[(n+1)/2]. a(n) = 6*a(n-2) - 4*a(n-4) for n>4. G.f.: (1+2*x-2*x^2)/(1-6*x^2+4*x^4).

EXAMPLE

Sequence begins: {1*1, 1*2, 2*2, 3*4, 5*4, 8*8, 13*8, 21*16, 34*16, ...}.

PROGRAM

(PARI) a(n)=fibonacci(n+1)*2^((n+1)\2)

CROSSREFS

Cf. A000045, A099602.

Sequence in context: A090922 A056228 A121569 this_sequence A062767 A052416 A059322

Adjacent sequences: A099600 A099601 A099602 this_sequence A099604 A099605 A099606

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 25 2004

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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research