cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A135881 Column 0 of triangle A135880.

Original entry on oeis.org

1, 1, 2, 6, 25, 138, 970, 8390, 86796, 1049546, 14563135, 228448504, 4002300038, 77523038603, 1646131568618, 38043008887356, 950967024783228, 25573831547118764, 736404945614783668, 22611026430036582671
Offset: 0

Views

Author

Paul D. Hanna, Dec 15 2007

Keywords

Comments

Amazingly, this sequence also equals column 0 of tables A135878 and A135879, which have unusual recurrences seemingly unrelated to triangle A135880.

Examples

			Equals column 0 of triangle P=A135880:
1;
1, 1;
2, 2, 1;
6, 7, 3, 1;
25, 34, 15, 4, 1;
138, 215, 99, 26, 5, 1;
970, 1698, 814, 216, 40, 6, 1;
8390, 16220, 8057, 2171, 400, 57, 7, 1; ...
where column k of P^2 equals column 0 of P^(2k+2)
such that column 0 of P^2 equals this sequence shift left.
Also equals column 0 of irregular triangle A135879:
1;
1,1;
2,2,1,1;
6,6,4,4,2,2,1;
25,25,19,19,13,13,9,5,5,3,1,1;
138,138,113,113,88,88,69,50,50,37,24,24,15,10,5,5,2,1; ...
which has a recurrence similar to that of triangle A135877
which generates the double factorials.

Links

Crossrefs

Cf. A135880, A135879, A135878; other columns: A135882, A135883, A135884.

Programs

  • PARI
    /* Generated as column 0 in triangle A135880: */ {a(n)=local(P=Mat(1),R,PShR);if(n==0,1,for(i=0,n, PShR=matrix(#P,#P, r,c, if(r>=c,if(r==c,1,if(c==1,0,P[r-1,c-1]))));R=P*PShR; R=matrix(#P+1, #P+1, r,c, if(r>=c, if(r<#P+1,R[r,c],if(c==1,(P^2)[ #P,1],(P^(2*c-1))[r-c+1,1])))); P=matrix(#R, #R, r,c, if(r>=c, if(r<#R,P[r,c], (R^c)[r-c+1,1]))));P[n+1,1])}
  • PARI
    /* Generated as column 0 in triangle A135879 (faster): */ {a(n)=local(A=[1],B);if(n>0,for(i=1,n,m=1;B=[]; for(j=1,#A,if(j+m-1==floor((m+2)^2/4)-1,m+=1;B=concat(B,0));B=concat(B,A[ j])); A=Vec(Polrev(Vec(Pol(B)/(1-x+O(x^#B)))))));A[1]}

Extensions

Typo in entries (false comma) corrected by N. J. A. Sloane, Jan 23 2008

A136213 Triple factorial triangle, read by rows of 3n(n+1)/2+1 terms, where row n+1 is generated from row n by first inserting zeros in row n at positions {[m*(m+5)/6], m=0..3n-1} and then taking partial sums, starting with a '1' in row 0.

Original entry on oeis.org

1, 1, 1, 1, 1, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 28, 28, 28, 28, 24, 24, 20, 20, 16, 16, 12, 9, 9, 6, 4, 4, 2, 1, 1, 280, 280, 280, 280, 252, 252, 224, 224, 196, 196, 168, 144, 144, 120, 100, 100, 80, 64, 64, 48, 36, 27, 27, 18, 12, 8, 8, 4, 2, 1, 1, 3640, 3640, 3640, 3640, 3360
Offset: 0

Views

Author

Paul D. Hanna, Dec 22 2007

Keywords

Comments

Square array A136212 is generated by a complementary process. This is the triple factorial variant of triangles A135877 (double factorials) and A127452 (factorials).

Examples

			Triangle begins:
1;
1,1,1,1;
4,4,4,4,3,3,2,2,1,1;
28,28,28,28,24,24,20,20,16,16,12,9,9,6,4,4,2,1,1;
280,280,280,280,252,252,224,224,196,196,168,144,144,120,100,100,80,64,64,48,36,27,27,18,12,8,8,4,2,1,1;
3640,3640,3640,3640,3360,3360,3080,3080,2800,2800,2520,2268,2268,2016,1792,1792,1568,1372,1372,1176,1008,864,864,720,600,500,500,400,320,256,256,192,144,108,81,81,54,36,24,16,16,8,4,2,1,1;
...
To generate row 3, start with row 2:
[4,4,4,4,3,3,2,2,1,1];
insert zeros at positions [0,1,2,4,6,8,11,14,17] to get:
[0,0,0,4,0,4,0,4,0,4,3,0,3,2,0,2,1,0,1],
then take reverse partial sums (from right to left) to obtain row 3:
[28,28,28,28,24,24,20,20,16,16,12,9,9,6,4,4,2,1,1].
Continuing in this way will generate all the rows of this triangle.

Crossrefs

Cf. A007559; related tables: A136212, A136218, A136214, A135877.

Programs

  • PARI
    {T(n,k)=local(A=[1],B);if(n>0,for(i=1,n,m=1;B=[0,0]; for(j=1,#A,if(j+m-1==(m*(m+7))\6,m+=1;B=concat(B,0));B=concat(B,A[j])); A=Vec(Polrev(Vec(Pol(B)/(1-x+O(x^#B)))))));if(k+1>#A,0,A[k+1])}

Formula

Column 0 forms the triple factorials A007559.

A135876 Square array, read by antidiagonals, where row n+1 is generated from row n by first removing terms at positions [(m+2)^2/4 - 1] for m>=0 and then taking partial sums, starting with all 1's in row 0.

Original entry on oeis.org

1, 1, 1, 3, 2, 1, 15, 8, 3, 1, 105, 48, 15, 4, 1, 945, 384, 105, 23, 5, 1, 10395, 3840, 945, 176, 33, 6, 1, 135135, 46080, 10395, 1689, 279, 44, 7, 1, 2027025, 645120, 135135, 19524, 2895, 400, 57, 8, 1, 34459425, 10321920, 2027025, 264207, 35685, 4384, 561
Offset: 0

Views

Author

Paul D. Hanna, Dec 14 2007

Keywords

Comments

This is the double factorial analog of Moessner's factorial array (A125714). Compare to triangle A135877 which is generated by a complementary process. A very interesting variant is square array A135878.

Examples

			Square array begins:
(1),(1),1,(1),1,(1),1,1,(1),1,1,(1),1,1,1,(1),1,1,1,(1),1,1,1,1,(1),...;
(1),(2),3,(4),5,(6),7,8,(9),10,11,(12),13,14,15,(16),17,18,19,(20),...;
(3),(8),15,(23),33,(44),57,71,(86),103,121,(140),161,183,206,(230),..;
(15),(48),105,(176),279,(400),561,744,(950),1206,1489,(1800),2171,..;
(105),(384),945,(1689),2895,(4384),6555,9129,(12139),16161,20763,..;
(945),(3840),10395,(19524),35685,(56448),89055,129072,(177331),245778,...;
(10395),(46080),135135,(264207),509985,(836352),1381905,2071215,(2924172),.;
(135135),(645120),2027025,(4098240),8294895,(14026752),24137505,...; ...
where terms in parenthesis are removed before taking partial sums.
For example, to generate row 2 from row 1, remove terms at positions
{[(m+2)^2/4-1], m>=0} = [0,1,3,5,8,11,15,19,24,29,35,...] to obtain:
[3, 5, 7,8, 10,11, 13,14,15, 17,18,19, 21,22,23,24, 25,26,27,28, ...]
then take partial sums to get row 2:
[3, 8, 15,23, 33,44, 57,71,86, 103,121,140, 161,183,206,230, ...].
Repeating this process will generate all the rows of the triangle,
where column 0 will be the odd double factorials (A001147)
and column 1 will be the even double factorials (A000165).

Crossrefs

Cf. columns: A001147, A000165, A004041, A129890; variants: A135878, A125714.

Programs

  • PARI
    {T(n, k)=local(A=0, b=0, c=0, d=0); if(n==0, A=1, until(d>k, if(c==floor((b+2)^2/4)-1, b+=1, A+=T(n-1, c); d+=1); c+=1)); A}

Formula

T(n,0) = (2n)!/n!/2^n; T(n,1) = 2^n*n!; T(n,2) = (2n+1)!/n!/2^n; T(n,3) = A004041(n) = (2n+1)!/n!/2^n * Sum_{k=0..n} 1/(2k+1). T(n,4) = A129890(n) = 2^(n+1)*(n+1)! - (2n+1)!/n!/2^n = T(n+1,1)-T(n+1,0).

A135879 Triangle, read by rows of A135901(n) terms, where row n+1 is generated from row n by inserting zeros at positions [(m+3)^2/4 - 2], as m=0,1,2,3,... and then taking partial sums from right to left, starting with a single 1 in row 0.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 1, 6, 6, 4, 4, 2, 2, 1, 25, 25, 19, 19, 13, 13, 9, 5, 5, 3, 1, 1, 138, 138, 113, 113, 88, 88, 69, 50, 50, 37, 24, 24, 15, 10, 5, 5, 2, 1, 970, 970, 832, 832, 694, 694, 581, 468, 468, 380, 292, 292, 223, 173, 123, 123, 86, 62, 38, 38, 23, 13, 8, 3, 3, 1, 8390
Offset: 0

Views

Author

Paul D. Hanna, Dec 14 2007

Keywords

Comments

Column 0 is A135881 which equals column 0 of square array A135878 and also equals column 0 of triangle A135880. Compare to square array A135878, which is generated by a complementary process. An interesting variant is triangle A135877 in which column 0 equals the double factorials (A001147).

Examples

			Triangle begins:
1;
1, 1;
2, 2, 1, 1;
6, 6, 4, 4, 2, 2, 1;
25, 25, 19, 19, 13, 13, 9, 5, 5, 3, 1, 1;
138, 138, 113, 113, 88, 88, 69, 50, 50, 37, 24, 24, 15, 10, 5, 5, 2, 1;
970, 970, 832, 832, 694, 694, 581, 468, 468, 380, 292, 292, 223, 173, 123, 123, 86, 62, 38, 38, 23, 13, 8, 3, 3, 1;
8390, 8390, 7420, 7420, 6450, 6450, 5618, 4786, 4786, 4092, 3398, 3398, 2817, 2349, 1881, 1881, 1501, 1209, 917, 917, 694, 521, 398, 275, 275, 189, 127, 89, 51, 51, 28, 15, 7, 4, 1, 1;
There are A135901(n) number of terms in row n.
To generate the triangle, start with a single 1 in row 0,
and then obtain row n+1 from row n by inserting zeros at
positions {[(m+3)^2/4 - 2], m=0,1,2,...} and then
taking reverse partial sums (i.e., summing from right to left).
Start with row 0, insert a zero in front of the '1' at position 0:
[0,1];
take reverse partial sums to get row 1:
[1,1];
insert zeros at positions [0,2]:
[0,1,0,1];
take reverse partial sums to get row 2:
[2,2,1,1];
insert zeros at positions [0,2,4]:
[0,2,0,2,0,1,1];
take reverse partial sums to get row 3:
[6,6,4,4,2,2,1];
insert zeros at positions [0,2,4,7]:
[0,6,0,6,0,4,4,0,2,2,0,1];
take reverse partial sums to get row 4:
[25,25,19,19,13,13,9,5,5,3,1,1];
insert zeros at positions [0,2,4,7,10,14]:
[0,25,0,25,0,19,19,0,13,13,0,9,5,5,0,3,1,1];
take reverse partial sums to get row 5:
[138,138,113,113,88,88,69,50,50,37,24,24,15,10,5,5,2,1].
Triangle A135880 begins:
1;
1, 1;
2, 2, 1;
6, 7, 3, 1;
25, 34, 15, 4, 1;
138, 215, 99, 26, 5, 1;
970, 1698, 814, 216, 40, 6, 1; ...
and is generated by matrix powers of itself.

Crossrefs

Cf. A135881, A135901, A135878, A135880; variants: A135877, A127452, A125781.

Programs

  • PARI
    {T(n,k)=local(A=[1],B);if(n>0,for(i=1,n,m=1;B=[]; for(j=1,#A,if(j+m-1==floor((m+2)^2/4)-1,m+=1;B=concat(B,0));B=concat(B,A[j])); A=Vec(Polrev(Vec(Pol(B)/(1-x+O(x^#B)))))));if(k+1>#A,0,A[k+1])}
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.