Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135922
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135922 Inverse binomial transform of A006116, which is the sum of Gaussian binomial coefficients [n,k] for q=2. +0
2
1, 1, 2, 6, 26, 158, 1330, 15414, 245578, 5382862, 162700898, 6801417318, 394502066810, 31849226170622, 3589334331706258, 566102993389615254, 125225331231990004138, 38920655753545108286254 (list; graph; listen)
OFFSET

0,3

FORMULA

O.g.f.: A(x) = Sum_{n>=0} x^n / Product_{k=0..n} (1 - (2^k-1)*x).

EXAMPLE

O.g.f.: A(x) = 1 + x/(1-x) + x^2/((1-x)*(1-3x)) + x^3/((1-x)*(1-3x)*(1-7x)) + x^4/((1-x)*(1-3x)*(1-7x)*(1-15x)) + ...

PROGRAM

(PARI) a(n)=polcoeff(sum(k=0, n, x^k/prod(j=0, k, 1-(2^j-1)*x+x*O(x^n))), n)

CROSSREFS

Cf. A006116.

Sequence in context: A099758 A099760 A112934 this_sequence A103367 A047863 A141713

Adjacent sequences: A135919 A135920 A135921 this_sequence A135923 A135924 A135925

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 06 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research