|
| |
|
|
A102526
|
|
Antidiagonal sums of Losanitsch's triangle (A034851).
|
|
3
| |
|
|
1, 1, 2, 2, 4, 5, 9, 12, 21, 30, 51, 76, 127, 195, 322, 504, 826, 1309, 2135, 3410, 5545, 8900, 14445, 23256, 37701, 60813, 98514, 159094, 257608, 416325, 673933, 1089648, 1763581, 2852242, 4615823, 7466468, 12082291, 19546175, 31628466
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| This is an interleaving of A005207 and A051450. Thus a(2*m) = A005207(m) = (F(2*m-1) + F(m+1)) / 2, a(2*m - 1) = A051450(m) = (F(2*m) + F(m)) / 2 where F() are Fibonacci numbers (A000045). - Max Alekseyev, Jun 28 2006.
The Kn11(n) and Kn21(n) sums, see A180662 for their definitions, of Losanitsch's triangle A034851 equal a(n), while the Kn12(n) and Kn22(n) sums equal (a(n+2)-A000012(n)) and the Kn13(n) and Kn23(n) sums equal (a(n+4)-A008619(n+4)) [Johannes W. Meijer, Jul 14 2011]
|
|
|
REFERENCES
| Jablan S. and Sazdanovic R., LinKnot: Knot Theory by Computer, World Scientific Press, 2007.
|
|
|
MAPLE
| A102526 :=proc(n) with(combinat): if type(n, even) then (fibonacci(n+1)+fibonacci(n/2+2))/2 else (fibonacci(n+1)+fibonacci((n+1)/2))/2 fi: end: seq(A102526(n), n=0..38); [Johannes W. Meijer, Jul 14 2011]
|
|
|
CROSSREFS
| Cf. A034851.
Essentially the same as A001224, A060312 and A068928.
Sequence in context: A124280 A088518 A001224 * A050192 A191786 A007147
Adjacent sequences: A102523 A102524 A102525 * A102527 A102528 A102529
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Feb 24 2005
|
| |
|
|
