login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118433 Self-inverse triangle H, read by rows; a nontrivial matrix square-root of identity: H^2 = I, where H(n,k) = C(n,k)*(-1)^(floor((n+1)/2) - floor(k/2) + n - k) for n >= k >= 0. 11
1, 1, -1, -1, 2, 1, -1, 3, 3, -1, 1, -4, -6, 4, 1, 1, -5, -10, 10, 5, -1, -1, 6, 15, -20, -15, 6, 1, -1, 7, 21, -35, -35, 21, 7, -1, 1, -8, -28, 56, 70, -56, -28, 8, 1, 1, -9, -36, 84, 126, -126, -84, 36, 9, -1, -1, 10, 45, -120, -210, 252, 210, -120, -45, 10, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,5
COMMENTS
There are an infinite number of integer square-roots of the identity matrix.
A118433 is a generator for a signed version of A000587, the Rao Uppuluri-Carpenter numbers (cf. triangle A144185). - Gary W. Adamson, Sep 13 2008
LINKS
FORMULA
E.g.f.: A(x,y) = cos(x)*exp(-x*y) + sin(x)*exp(x*y).
O.g.f.: A(x,y) = (1 + x*(1-y) + x^2*(1+2*y-y^2) + x^3*(1+y+y^2+y^3)) / (1 + 2*x^2*(1-y^2) + x^4*(1+y^2)^2).
EXAMPLE
Triangle H begins:
1;
1, -1;
-1, 2, 1;
-1, 3, 3, -1;
1, -4, -6, 4, 1;
1, -5, -10, 10, 5, -1;
-1, 6, 15, -20, -15, 6, 1;
-1, 7, 21, -35, -35, 21, 7, -1;
1, -8, -28, 56, 70, -56, -28, 8, 1;
1, -9, -36, 84, 126, -126, -84, 36, 9, -1;
-1, 10, 45, -120, -210, 252, 210, -120, -45, 10, 1; ...
G.f.s for columns:
k=0: (x + 1)/(1+x^2);
k=1: (x^2 + 2*x - 1)/(1+x^2)^2;
k=2: (-x^3 - 3*x^2 + 3*x + 1)/(1+x^2)^3;
k=3: (-x^4 - 4*x^3 + 6*x^2 + 4*x - 1)/(1+x^2)^4;
k=4: (x^5 + 5*x^4 - 10*x^3 - 10*x^2 + 5*x + 1)/(1+x^2)^5;
k=5: (x^6 + 6*x^5 - 15*x^4 - 20*x^3 + 15*x^2 + 6*x - 1)/(1+x^2)^6.
The g.f. of column k is thus:
G_k(x) = (Sum_{j=0..k+1} -H(k+1,j)*(-x)^(k+1-j))/(1+x^2)^(k+1).
The triangle formed from above polynomial numerators of column g.f.s is described by the e.g.f.: cos(x*y)*exp(-x) - sin(x*y)*exp(x).
MATHEMATICA
H[n_, k_] := Binomial[n, k]*(-1)^(Quotient[n+1, 2]-Quotient[k, 2]+n-k);
Table[H[n, k], {n, 0, 12}, {k, 0, n}] // Flatten (* Jean-François Alcover, Apr 08 2024 *)
PROG
(PARI) {H(n, k)=binomial(n, k)*(-1)^((n+1)\2-k\2+n-k)}
for(n=0, 12, for(k=0, n, print1(H(n, k), ", ")); print(""))
(PARI) /* Using E.G.F.: */
{H(n, k)=local(x=X+X*O(X^n), y=Y+Y*O(Y^k)); n!*polcoeff(polcoeff( cos(x)*exp(-x*y)+sin(x)*exp(x*y), n, X), k, Y)}
for(n=0, 12, for(k=0, n, print1(H(n, k), ", ")); print(""))
(PARI) /* Using O.G.F.: */
{H(n, k)=polcoeff(polcoeff((1+x*(1-y)+x^2*(1+2*y-y^2)+x^3*(1+y+y^2+y^3))/(1+2*x^2*(1-y^2)+x^4*(1+y^2)^2+x*O(x^n)+y*O(y^k)), n, x), k, y)}
for(n=0, 12, for(k=0, n, print1(H(n, k), ", ")); print(""))
CROSSREFS
Cf. A118434 (row sums), A118435 (H*[C^-1]*H).
Cf. A144185, A000587. - Gary W. Adamson, Sep 13 2008
Sequence in context: A094495 A154926 A117440 * A007318 A108086 A130595
KEYWORD
sign,tabl
AUTHOR
Paul D. Hanna, Apr 28 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 06:07 EDT 2024. Contains 371918 sequences. (Running on oeis4.)