Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128709
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128709 O.g.f.: A(x) = 1/(1-1*x/(1-3*x/(1-5*x/(1-7*x/(1-...-(2n-1)*x/(1-...)))))) (continued fraction). +0
4
1, 1, 4, 31, 364, 5746, 113944, 2719291, 75843724, 2420160286, 86941080904, 3471911602006, 152562875644984, 7315129181611876, 380045172886143664, 21266347877729314771, 1275148311699896290444, 81563275661324271278566 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=Sum_{k, 0<=k<=n}(-1)^k*2^(n-k)*A053979(n,k). - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 24 2007

a(n)=Sum_{k, 0<=k<=n}A094344(n,k)*3^(n-k). - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 27 2007

EXAMPLE

G.f.: A(x) = 1 + x + 4x^2 + 31x^3 + 364x^4 + 5746x^5 +...;

A(x) = 1/(1 - x*(1 + 3x + 24x^2 + 297x^3 + 4896x^4 +...));

A(x) = 1/(1 - x/(1 - 3x*(1 + 5x + 60x^2 + 1035x^3 + 22500x^4+...)));

A(x) = 1/(1 - x/(1 - 3x/(1 - 5x*(1 + 7x + 112x^2 + 2485x^3 +...)))).

PROGRAM

(PARI) {a(n)=local(CF=1+x*O(x^n)); for(k=0, n, CF=1/(1-(2*n-2*k+1)*x*CF)); polcoeff(CF, n, x)}

CROSSREFS

Sequence in context: A086677 A016036 A000314 this_sequence A138860 A005046 A005841

Adjacent sequences: A128706 A128707 A128708 this_sequence A128710 A128711 A128712

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Mar 23 2007

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 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research