|
|
A259549
|
|
Triangle T(n,k) with rows of length 2n-1 filled with consecutive integers, each appearing twice except for the last term, T(n,2n-1) = n(n+1)/2.
|
|
1
|
|
|
1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 7, 8, 8, 9, 9, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 37, 37, 38, 38
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence is derived from the water retention heights between a group of hexagonally packed, vertically oriented cylinders. The cylinders fill an equilateral triangle. The cylinder height is specified by sequential natural numbers.
This entry is motivated by A258445 and A259052. The water retention on mathematical surfaces concept uses the integer values to specify the height of cylinders. Three touching cylinders define the retention unit and thus a relationship between 3 integers. Taking the minimum, maximum or sum of these three integers provides the data points to construct a new triangle. The water retention between three cylinders is the minimum of the three heights.
The row sums for the minimum of three terms in this triangle are A081436.
The retention values between rows can be thought of having a wave form with peak and trough values. These peak and trough values correspond to A006002 and A006003. This water retention business shows that A081436(n) = A006002(n) + A006003(n+1).
In general any 2D arrangement of numbers can be subdivided by up and down retention triples.
The terms of the "flattened" sequence (concatenation of the rows) are the positive integers, repeated twice except for (1, 3, 6, 10, ...) = triangular numbers A000217, which are only listed once. - M. F. Hasler, Aug 11 2015
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (1/4)*(2*t(n) + 1 - (-1)^t(n)), where t(n) = n + floor(sqrt(n)). - Ridouane Oudra, Jun 08 2019
|
|
EXAMPLE
|
The irregular triangle T(n,k) starts:
n/k 1 2 3 4 5 6 7 8 9 10 11
1: 1
2: 2 2 3
3: 4 4 5 5 6
4: 7 7 8 8 9 9 10
5: 11 11 12 12 13 13 14 14 15
6: 16 16 17 17 18 18 19 19 20 20 21
|
|
PROG
|
(PARI) a259549(nmax) = { /* Give the first nmax rows */
my(L=List(), t);
for(n=1, nmax,
t=(n^2-n+2)/2;
for(k=0, n-2,
listput(L, t+k); listput(L, t+k)
);
listput(L, n*(n+1)/2)
);
Vec(L)
}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|