Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025259
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025259 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-3)*a(3) for n >= 4. +0
1
2, -1, 1, 2, 3, 5, 11, 27, 65, 154, 371, 917, 2303, 5828, 14839, 38049, 98237, 255106, 665655, 1744318, 4588881, 12115727, 32092597, 85259160, 227117149, 606512641, 1623412007, 4354539253, 11703442343, 31512560472, 84996156243, 229621401075 (list; graph; listen)
OFFSET

1,1

FORMULA

G.f.: (1+2x-x^2-sqrt(1-4x+6x^2-8x^3+x^4))/(2x)=2-x+x^2*c(x^2/(1-x)^4)/(1-x)^2, c(x) the g.f. of A000108; a(n+3)=sum{k=0..floor(n/2), C(n+3k+1,6k+1)C(k)}, where C(n)=A000108(n). - Paul Barry (pbarry(AT)wit.ie), May 31 2006

CROSSREFS

Sequence in context: A022910 A030737 A058713 this_sequence A130030 A088022 A016732

Adjacent sequences: A025256 A025257 A025258 this_sequence A025260 A025261 A025262

KEYWORD

sign

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research