|
Search: id:A095871
|
|
|
| A095871 |
|
Triangle read by rows: T(n,k)=(n+1)*(3*(n+1)-1)/2-k*(3*k-1)/2 |
|
+0
4
|
|
| 1, 5, 4, 12, 11, 7, 22, 21, 17, 10, 35, 34, 30, 23, 13, 51, 50, 46, 39, 29, 16, 70, 69, 65, 58, 48, 35, 19, 92, 91, 87, 80, 70, 57, 41, 22, 117, 116, 112, 105, 95, 82, 66, 47, 25, 145, 144, 140, 133, 123, 110, 94, 75, 53, 28, 176, 175, 171, 164, 154, 141, 125, 106, 84, 59
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Octagonal pyramidal number triangle, read by rows.
The triangle is generated from the product B*A 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...
T(n,0)=A000326(n+1)
T(n,2)=A059845(n+2)
T(n,n)=3*n+1
|
|
FORMULA
|
Triangle read by rows, T(n,k) = sum {j=k..n} 3*j - 2 = A000012 * ((3*j - 2) * 0^(n-k)) * A000012; 1<=k<=n. E.g. T(5,3) = 30 = (7 + 10 + 13).
|
|
EXAMPLE
|
Column 3 = A059845: 7, 17, 30, 46, 65...; while rightmost terms of rows are 1, 4, 7, 10...
First few rows of the triangle =
1;
5, 4;
12, 11, 7;
22, 21, 17, 10;
35, 34, 30, 23, 13;
51, 50, 46, 39, 29, 16;
70, 69, 65, 58, 48, 35, 19;
...
|
|
PROGRAM
|
(PARI) T(n, k) = local(i); if(k>n, 0, (n+1)*(3*(n+1)-1)/2-k*(3*k-1)/2) for(i=0, 10, for(j=0, i, print1(T(i, j), ", ")); print()) (Klasen)
|
|
CROSSREFS
|
Row sums give octagonal pyramidal numbers A002414
Cf. A095872, A000326, A059845, A002414.
Sequence in context: A140869 A166549 A131875 this_sequence A019068 A147685 A078930
Adjacent sequences: A095868 A095869 A095870 this_sequence A095872 A095873 A095874
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 10 2004, Jul 28 2008
|
|
EXTENSIONS
|
More terms from Lambert Klasen (Lambert.Klasen(AT)gmx.net), Jan 21 2005
|
|
|
Search completed in 0.002 seconds
|
