About the Project

Vandermonde%20sum

AdvancedHelp

(0.001 seconds)

11—20 of 422 matching pages

11: 26.3 Lattice Paths: Binomial Coefficients
26.3.3 n = 0 m ( m n ) x n = ( 1 + x ) m , m = 0 , 1 , ,
26.3.4 m = 0 ( m + n m ) x m = 1 ( 1 x ) n + 1 , | x | < 1 .
26.3.7 ( m + 1 n + 1 ) = k = n m ( k n ) , m n 0 ,
26.3.8 ( m n ) = k = 0 n ( m n 1 + k k ) , m n 0 .
26.3.10 ( m n ) = k = 0 n ( 1 ) n k ( m + 1 k ) , m n 0 ,
12: 4.11 Sums
§4.11 Sums
13: 26.10 Integer Partitions: Other Restrictions
where the last right-hand side is the sum over m 0 of the generating functions for partitions into distinct parts with largest part equal to m . … where the inner sum is the sum of all positive odd divisors of t . … where the sum is over nonnegative integer values of k for which n 1 2 ( 3 k 2 ± k ) 0 . … where the sum is over nonnegative integer values of k for which n ( 3 k 2 ± k ) 0 . … where the inner sum is the sum of all positive divisors of t that are in S . …
14: 8 Incomplete Gamma and Related
Functions
15: 28 Mathieu Functions and Hill’s Equation
16: 26.2 Basic Definitions
A partition of a nonnegative integer n is an unordered collection of positive integers whose sum is n . … The integers whose sum is n are referred to as the parts in the partition. …
Table 26.2.1: Partitions p ( n ) .
n p ( n ) n p ( n ) n p ( n )
3 3 20 627 37 21637
17: 8.26 Tables
  • Khamis (1965) tabulates P ( a , x ) for a = 0.05 ( .05 ) 10 ( .1 ) 20 ( .25 ) 70 , 0.0001 x 250 to 10D.

  • Abramowitz and Stegun (1964, pp. 245–248) tabulates E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x = 0 ( .01 ) 2 to 7D; also ( x + n ) e x E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x 1 = 0 ( .01 ) 0.1 ( .05 ) 0.5 to 6S.

  • Pagurova (1961) tabulates E n ( x ) for n = 0 ( 1 ) 20 , x = 0 ( .01 ) 2 ( .1 ) 10 to 4-9S; e x E n ( x ) for n = 2 ( 1 ) 10 , x = 10 ( .1 ) 20 to 7D; e x E p ( x ) for p = 0 ( .1 ) 1 , x = 0.01 ( .01 ) 7 ( .05 ) 12 ( .1 ) 20 to 7S or 7D.

  • Zhang and Jin (1996, Table 19.1) tabulates E n ( x ) for n = 1 , 2 , 3 , 5 , 10 , 15 , 20 , x = 0 ( .1 ) 1 , 1.5 , 2 , 3 , 5 , 10 , 20 , 30 , 50 , 100 to 7D or 8S.

  • 18: 23 Weierstrass Elliptic and Modular
    Functions
    19: 4.41 Sums
    §4.41 Sums
    For sums of hyperbolic functions see Gradshteyn and Ryzhik (2000, Chapter 1), Hansen (1975, §43), Prudnikov et al. (1986a, §5.3), and Zucker (1979).
    20: 7.15 Sums
    §7.15 Sums
    For sums involving the error function see Hansen (1975, p. 423) and Prudnikov et al. (1986b, vol. 2, pp. 650–651).