|
Search: id:A059036
|
|
|
| A059036 |
|
In a triangle of numbers (such as that in A059032, A059033, A059034) how many entries lie above position (n,k)? Answer: T(n,k) = (n+1)*(k+1)-1 (n >= 0, k >= 0). |
|
+0
1
|
|
| 0, 1, 1, 2, 3, 2, 3, 5, 5, 3, 4, 7, 8, 7, 4, 5, 9, 11, 11, 9, 5, 6, 11, 14, 15, 14, 11, 6, 7, 13, 17, 19, 19, 17, 13, 7, 8, 15, 20, 23, 24, 23, 20, 15, 8, 9, 17, 23, 27, 29, 29, 27, 23, 17, 9, 10, 19, 26, 31, 34, 35, 34, 31, 26, 19, 10, 11, 21, 29, 35, 39, 41
(list; table; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
As a square array read by anti-diagonals, this has e.g.f. exp(x+y)(x+y+xy). - Paul Barry (pbarry(AT)wit.ie), Sep 24 2004
|
|
FORMULA
|
T(n, k) = max{T(n-1, k-1), T(n-1, k)} + min{k, n-k+1} - Jon Perry (perry(AT)globalnet.co.uk), Aug 05 2004
|
|
EXAMPLE
|
0; 1,1; 2,3,2; 3,5,5,3; 4,7,8,7,4; ...
|
|
CROSSREFS
|
T(n, k) = A003991(n, k) - 1.
Sequence in context: A046147 A052369 A110976 this_sequence A085207 A085203 A118088
Adjacent sequences: A059033 A059034 A059035 this_sequence A059037 A059038 A059039
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
njas, Feb 13 2001
|
|
|
Search completed in 0.002 seconds
|
