Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136097
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136097 a(n) = A135951(n) /[(2^(n+1)-1) * 2^(n*(n-1)/2)]. +0
1
1, -1, 5, -93, 6477, -1733677, 1816333805, -7526310334829, 124031223014725741, -8152285307423733458541, 2140200604371078953284092525, -2245805993494514875022552272042605, 9423041917569791458584837551185555483245 (list; graph; listen)
OFFSET

0,3

COMMENT

A135951 is the central terms of A135950; A135950 is the matrix inverse of A022166; A022166 is the triangle of Gaussian binomial coefficients [n,k] for q = 2.

FORMULA

Conjecture: the n-th central term of the matrix inverse of the triangle of Gaussian binomial coefficients in q is divisible by [(q^(n+1)-1)/(q-1) * q^(n*(n-1)/2)] for n>=0 and integer q > 1.

PROGRAM

(PARI) {a(n)=local(q=2, A=matrix(2*n+1, 2*n+1, n, k, if(n>=k, if(n==1|k==1, 1, prod(j=n-k+1, n-1, 1-q^j)/prod(j=1, k-1, 1-q^j))))^-1); A[2*n+1, n+1]/( (q^(n+1)-1)/(q-1) * q^(n*(n-1)/2) )}

CROSSREFS

Cf. A135951, A135950, A022166.

Adjacent sequences: A136094 A136095 A136096 this_sequence A136098 A136099 A136100

Sequence in context: A000365 A012784 A015030 this_sequence A047052 A049662 A116159

KEYWORD

sign

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 13 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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research