OFFSET
0,1
REFERENCES
L. Carlitz, Generating functions and partition problems, pp. 144-169 of A. L. Whiteman, ed., Theory of Numbers, Proc. Sympos. Pure Math., 8 (1965). Amer. Math. Soc., see p. 163.
FORMULA
Left column = powers of 2, right column = central binomial coefficients C(2n,n); interior entries = sum of entry above and entry to the left. - N. J. A. Sloane, Jun 18 2016
EXAMPLE
T(2,1) = 6 because the n row can go 2,2,1,0 with the k row either 1,1,0,0 or 1,0,0,0; the n row can go 2,2,0,0 with those same k rows; or the n row can go 2,1,0,0 or 2,0,0,0 with the k row going 1,0,0,0 (since k must be strictly less than n, except when both are 0).
Triangle begins:
2,
4, 6,
8, 14, 20,
16, 30, 50, 70,
32, 62, 112, 182, 252,
64, 126, 238, 420, 672, 924,
128, 254, 492, 912, 1584, 2508, 3432,
PROG
;; PLT DrScheme from Joshua Zucker
(define ht (make-hash-table 'equal))
(define (A039597 n k)
(local ((define (help n k)
(cond
[(= n 0) (cond [(= k 0) 1] [else 0])]
[(>= k n) 0]
[else
(hash-table-get ht (list n k) (lambda ()
(let ([answer (apply + (apply append (build-list n (lambda (n1) (build-list (cond [(= k 0) 1] [else k])
(lambda (k1) (help n1 k1)))))))])
(begin (hash-table-put! ht (list n k) answer)
answer))))])))
(cond
[(>= k n) 0]
[else (apply + (apply append (build-list (add1 n) (lambda (n1) (build-list (add1 k) (lambda (k1) (help n1 k1)))))))])))
CROSSREFS
KEYWORD
AUTHOR
EXTENSIONS
More terms from Joshua Zucker, Jun 22 2006
STATUS
approved