 |
(1)
|
Losanitsch's triangle (Sloane's A034851) is a number
triangle for which each term is the sum of the two numbers immediately above
it, except that, numbering the rows by , 1, 2, ... and
the entries in each row by , 1, 2, ...,
, are given by the recurrence equations
 |
(2)
|
where is a binomial coefficient.
can be written in closed form as
![a(n,k)=1/2[(n; k)+(n (mod 2); k (mod 2))(|_1/2n_|; |_1/2k_|)].](/images/equations/LosanitschsTriangle/NumberedEquation3.gif) |
(3)
|
The plot above shows the binary representations for the first 255 (top figure) and 511 (bottom figure) terms of a flattened Losanitsch's triangle.
The row sums of Losanitsch's triangle are
 |
(4)
|
the first few terms of which are 1, 2, 3, 6, 10, 20, 36, ... (Sloane's A005418).
Losanitsch, S. M. "Die Isometrie-Arten bei den Homologen der Paraffin-Reihe."
Chem. Ber. 30, 1917-1926, 1897.
Sloane, N. J. A. http://www.research.att.com/~njas/sequences/classic.html#LOSS.
Sloane, N. J. A. Sequences A005418 and A034851 in "The On-Line Encyclopedia of Integer Sequences."
|