Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113149
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113149 Row 8 of table A113143; equal to INVERT of 8-fold factorials shifted one place right. +0
2
1, 1, 2, 12, 176, 4184, 134824, 5451528, 264710536, 14992543432, 969925065992, 70547721068232, 5697913588192520, 505926926171909576, 48979597517592503560, 5134435963996172979912, 579379155027833982679816 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = Sum_{j=0..k} 8^(k-j)*A111146(k, j).

a(0) = 1; a(n+1) = Sum_{k=0..n} a(k)*A113137(n-k).

EXAMPLE

A(x) = 1 + x + 2*x^2 + 12*x^3 + 176*x^4 + 4184*x^5 +...

= 1/(1 - x - x^2 - 9*x^3 - 153*x^4 -...- A113137(n)*x^(n+1)

-...).

PROGRAM

(PARI) {a(n)=local(x=X+X*O(X^n)); A=1/(1-x-x^2*sum(j=0, n, x^j*prod(i=0, j, 8*i+1))); return(polcoeff(A, n, X))}

CROSSREFS

Cf. A113143, A113137 (8-fold factorials).

Adjacent sequences: A113146 A113147 A113148 this_sequence A113150 A113151 A113152

Sequence in context: A052729 A098431 A059522 this_sequence A007129 A125861 A067962

KEYWORD

nonn

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr) and Paul D. Hanna (pauldhanna(AT)juno.com), Oct 28 2005

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research