Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014431
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014431 a(1) = 1, a(2) = 2, a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-2)*a(2) for n >= 3. +0
3
1, 2, 2, 6, 14, 42, 122, 382, 1206, 3922, 12914, 43190, 145950, 498170, 1714026, 5940014, 20712646, 72623266, 255875298, 905477734, 3216853294, 11469069258, 41023019098, 147166210014, 529374272470, 1908965352434, 6899707805522 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n)=2*A025235(n-2) for n>=2.

FORMULA

G.f.: (1+x-sqrt(1-2x-7x^2))/2. - Michael Somos, Jun 08 2000.

PROGRAM

(PARI) a(n)=polcoeff((1+x-sqrt(1-2*x-7*x^2+x*O(x^n)))/2, n)

CROSSREFS

Sequence in context: A002203 A097341 A142710 this_sequence A142471 A071208 A083555

Adjacent sequences: A014428 A014429 A014430 this_sequence A014432 A014433 A014434

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu) and Wouter Meeussen (wouter.meeussen(AT)pandora.be)

EXTENSIONS

Corrected by T. D. Noe (noe(AT)sspectra.com), Oct 31 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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research