|
|
A128076
|
|
Triangle T(n,k) = 2*n-k, read by rows.
|
|
10
|
|
|
1, 3, 2, 5, 4, 3, 7, 6, 5, 4, 9, 8, 7, 6, 5, 11, 10, 9, 8, 7, 6, 13, 12, 11, 10, 9, 8, 7, 15, 14, 13, 12, 11, 10, 9, 8, 17, 16, 15, 14, 13, 12, 11, 10, 9, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Table T(n,k) = n+2*k-2 n, k > 0, read by antidiagonals.
General case A209304. Let m be natural number. The first column of the table T(n,1) is the sequence of the natural numbers A000027. Every next column is formed from previous shifted by m elements.
for m=4 the result is A209304. (End)
|
|
LINKS
|
|
|
FORMULA
|
Matrix product A128064 * A004736 as infinite lower triangular matrices.
For the general case:
a(n) = m*(t+1) + (m-1)*(t*(t+1)/2-n), where t=floor((-1+sqrt(8*n-7))/2).
For m = 2:
a(n) = 2*(t+1)+(t*(t+1)/2-n), where t=floor((-1+sqrt(8*n-7))/2). (End)
a(n) = (r^2 + 3*r - 2*n)/2, where r = round(sqrt(2*n)). - Wesley Ivan Hurt, Sep 19 2021
|
|
EXAMPLE
|
First few rows of the triangle are:
1;
3, 2;
5, 4, 3;
7, 6, 5, 4;
9, 8, 7, 6, 5;
...
|
|
MAPLE
|
2*n-k ;
end proc:
|
|
MATHEMATICA
|
Table[(Round[Sqrt[2 n]]^2 + 3 Round[Sqrt[2 n]] - 2 n)/2, {n, 100}] (* Wesley Ivan Hurt, Sep 19 2021 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|