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-3 of 3 results.

A095872 Square of the lower triangular matrix T[i,j] = 3j-2 for 1<=j<=i, read by rows.

Original entry on oeis.org

1, 5, 16, 12, 44, 49, 22, 84, 119, 100, 35, 136, 210, 230, 169, 51, 200, 322, 390, 377, 256, 70, 176, 455, 580, 624, 560, 361, 70, 276, 455, 580, 624, 560, 361, 92, 364, 609, 800, 910, 912, 779, 484, 117, 464, 784, 1050, 1235, 1312, 1254, 1034, 625, 145, 576, 980, 1330, 1599
Offset: 1

Views

Author

Gary W. Adamson, Jun 10 2004

Keywords

Comments

Arranged by flush left columns (k=1,2,3...), (k=1) column = A000326, the pentagonal numbers (1, 5, 12, 22, 35...). The Octagonal pyramidal number triangle of A095871 is generated from A095872 by dividing the k-th row by the n-th term in the series 1, 4, 7, 10...(k starting with 1). Dividing the 3rd column of A095872 (49, 119, 210, 322, 455...) by 7 generates A059845: 7, 17, 30, 46, 65... Rightmost terms of each row of A095872 are A016778 (1, 16, 49, 100, 169...); i.e. squares of 1, 4, 7, 10... Row sums of A095872 are 1, 21, 105, 325, 780, 1596, 2926... Row sums of A095871 are the octagonal pyramidal numbers, A002414: 1, 9, 30, 70, 135, 231, 364...
[Editor's note: OEIS' "TABL" format (fmt=2) rather displays the transposed matrix as upper triangular matrix.]

Examples

			Let M = the infinite lower triangular matrix in the format exemplified by a 3rd order matrix: [1 0 0 / 1 4 0 / 1 4 7]: i.e. for the n-th order matrix, each row has n terms in the series 1, 4, 7, 10... with the rest of the spaces filled in with zeros. Square the matrix and delete the zeros; then read by rows.
[1 0 0 / 1 4 0 / 1 4 7]^2 = [1 0 0 / 5 16 0 / 12 44 49]; then delete the zeros and read by rows: 1, 5, 16, 12, 44, 49...
		

Crossrefs

Programs

  • PARI
    A095802(n)={ my( r=sqrtint(2*n)+1, T=matrix(r,r,i,j,if(j>=i,3*j-2))^2); concat(vector(#T,i,vecextract(T[,i],2^i-1)))[n] } \\ M. F. Hasler, Apr 18 2009

Formula

a(k(k+1)/2) = (3k-2)^2 (diagonal elements: squares of the initial series), a(k(k-1)/2+1) = A000326(k) (1st column: pentagonal numbers). - M. F. Hasler, Apr 18 2009

Extensions

Edited and extended by M. F. Hasler, Apr 18 2009

A095873 Triangle T(n,k) = (2*k-1)*(n+k-1)*(n-k+1) read by rows, 1<=k<=n.

Original entry on oeis.org

1, 4, 9, 9, 24, 25, 16, 45, 60, 49, 25, 72, 105, 112, 81, 36, 105, 160, 189, 180, 121, 49, 144, 225, 280, 297, 264, 169, 64, 189, 300, 385, 432, 429, 364, 225, 81, 240, 385, 504, 585, 616, 585, 480, 289, 100, 297, 480, 637, 756, 825
Offset: 1

Views

Author

Gary W. Adamson, Jun 10 2004

Keywords

Comments

Matrix square of A158405.

Examples

			[1 0 0 / 1 3 0 / 1 3 5]^2 = [1 0 0 / 4 9 0 / 9 24 25]. Delete the zeros and
read by rows:
1;
4, 9;
9, 24, 25;
16,45, 60, 49;
25,72,105,112, 81;
		

References

  • Albert H. Beiler, "Recreations in the Theory of Numbers", Dover, 1966.

Crossrefs

Programs

  • Maple
    A095873 := proc(n,k)
            (2*k-1)*(n+k-1)*(n-k+1) ;
    end proc:
    seq(seq(A095873(n,k),k=1..n),n=1..13) ; # R. J. Mathar, Oct 30 2011
  • Mathematica
    Table[(2k-1)(n+k-1)(n-k+1),{n,10},{k,n}]//Flatten (* Harvey P. Dale, May 03 2018 *)

Formula

T(n,k) = (2*k-1)*A094728(n,k).
Sum_{k=1..n} T(n,k)= n*(n+1)*(3*n^2+n-1)/6 = A103220(n). - R. J. Mathar, Oct 30 2011

Extensions

Definition in closed form by R. J. Mathar, Oct 30 2011

A101468 Triangle read by rows: T(n,k)=(n+1-k)*(3*k+1).

Original entry on oeis.org

1, 2, 4, 3, 8, 7, 4, 12, 14, 10, 5, 16, 21, 20, 13, 6, 20, 28, 30, 26, 16, 7, 24, 35, 40, 39, 32, 19, 8, 28, 42, 50, 52, 48, 38, 22, 9, 32, 49, 60, 65, 64, 57, 44, 25, 10, 36, 56, 70, 78, 80, 76, 66, 50, 28, 11, 40, 63, 80, 91, 96, 95, 88, 75, 56, 31, 12, 44, 70, 90, 104, 112, 114
Offset: 0

Views

Author

Lambert Klasen (lambert.klasen(AT)gmx.de) and Gary W. Adamson, Jan 21 2005

Keywords

Comments

The triangle is generated from the product A*B
of the infinite lower triangular matrices A =
1 0 0 0...
1 1 0 0...
1 1 1 0...
1 1 1 1...
... and B =
1 0 0 0...
1 4 0 0...
1 4 7 0...
1 4 7 10...
...
Row sums give pentagonal pyramidal numbers A002411 T(n+0,0)= 1*n=A000027(n) T(n+0,1)= 4*n=A008586(n) T(n+1,2)= 7*n=A008589(n) T(n+2,3)=10*n=A008592(n) ...
so for example T(n+1,n-0)=6*n+2=A016933(n) T(n+1,n-1)=9*n+3=A017197(n) T(n+2,n-1)=12*n+4=A017569(n)
T(n,0)*T(n,1) = A033996(n) (8 times triangular numbers)
T(n,n)*T(n,0) = A000567(n+1) (Octagonal numbers) etc.

Examples

			Triangle begins:
1,
2,  4,
3,  8,  7,
4,  12, 14, 10,
5,  16, 21, 20, 13,
6,  20, 28, 30, 26, 16,
7,  24, 35, 40, 39, 32, 19,
8,  28, 42, 50, 52, 48, 38, 22,
9,  32, 49, 60, 65, 64, 57, 44, 25,
10, 36, 56, 70, 78, 80, 76, 66, 50, 28,
11, 40, 63, 80, 91, 96, 95, 88, 75, 56, 31, etc.
[_Bruno Berselli_, Feb 10 2014]
		

Crossrefs

Cf. A095871 (product B*A), A002411.

Programs

  • Mathematica
    t[n_, k_] := If[n < k, 0, (3*k + 1)*(n - k + 1)]; Flatten[ Table[ t[n, k], {n, 0, 11}, {k, 0, n}]] (* Robert G. Wilson v, Jan 21 2005 *)
  • PARI
    T(n,k)=if(k>n,0,(n-k+1)*(3*k+1)) for(i=0,10, for(j=0,i,print1(T(i,j),", "));print())
Showing 1-3 of 3 results.