Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084178
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084178 Inverse binomial transform of Fibonacci oblongs. +0
2
0, 1, 0, 3, -1, 10, -7, 35, -36, 127, -165, 474, -715, 1807, -3004, 6995, -12393, 27370, -50559, 107883, -204820, 427351, -826045, 1698458, -3321891, 6765175, -13333932, 26985675, -53457121, 107746282, -214146295, 430470899, -857417220, 1720537327, -3431847189 (list; graph; listen)
OFFSET

0,4

COMMENT

Inverse binomial transform of A001654.

FORMULA

a(n)=((1/2+sqrt(5)/2)^(n+1)+(1/2-sqrt(5)/2)^(n+1)-(-2)^n)/5; G.f.: x(1+x)/(1+x-3x^2-2x^3)=x(1-x)/((1+2x)(1-x-x^2)).

CROSSREFS

Cf. A000045, A052964, A084179.

Sequence in context: A046658 A124574 A052964 this_sequence A068438 A064060 A134991

Adjacent sequences: A084175 A084176 A084177 this_sequence A084179 A084180 A084181

KEYWORD

easy,sign

AUTHOR

Paul Barry (pbarry(AT)wit.ie), May 18 2003

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research