About the Project

Dougall 7F6(1) sum

AdvancedHelp

(0.004 seconds)

11—20 of 837 matching pages

11: 26.9 Integer Partitions: Restricted Number and Part Size
The conjugate to the example in Figure 26.9.1 is 6 + 5 + 4 + 2 + 1 + 1 + 1 . … It is also equal to the number of lattice paths from ( 0 , 0 ) to ( m , k ) that have exactly n vertices ( h , j ) , 1 h m , 1 j k , above and to the left of the lattice path. … It is also assumed everywhere that | q | < 1 . … Also, when | x q | < 1 where the inner sum is taken over all positive divisors of t that are less than or equal to k . …
12: 4.25 Continued Fractions
4.25.1 tan z = z 1 z 2 3 z 2 5 z 2 7 , z ± 1 2 π , ± 3 2 π , .
4.25.2 tan ( a z ) = a tan z 1 + ( 1 a 2 ) tan 2 z 3 + ( 4 a 2 ) tan 2 z 5 + ( 9 a 2 ) tan 2 z 7 + , | z | < 1 2 π , a z ± 1 2 π , ± 3 2 π , .
4.25.3 arcsin z 1 z 2 = z 1 1 2 z 2 3 1 2 z 2 5 3 4 z 2 7 3 4 z 2 9 ,
4.25.4 arctan z = z 1 + z 2 3 + 4 z 2 5 + 9 z 2 7 + 16 z 2 9 + ,
4.25.5 e 2 a arctan ( 1 / z ) = 1 + 2 a z a + a 2 + 1 3 z + a 2 + 4 5 z + a 2 + 9 7 z + ,
13: 4.39 Continued Fractions
4.39.1 tanh z = z 1 + z 2 3 + z 2 5 + z 2 7 + , z ± 1 2 π i , ± 3 2 π i , .
4.39.2 arcsinh z 1 + z 2 = z 1 + 1 2 z 2 3 + 1 2 z 2 5 + 3 4 z 2 7 + 3 4 z 2 9 + ,
4.39.3 arctanh z = z 1 z 2 3 4 z 2 5 9 z 2 7 ,
14: 28.16 Asymptotic Expansions for Large q
Let s = 2 m + 1 , m = 0 , 1 , 2 , , and ν be fixed with m < ν < m + 1 . …
28.16.1 λ ν ( h 2 ) 2 h 2 + 2 s h 1 8 ( s 2 + 1 ) 1 2 7 h ( s 3 + 3 s ) 1 2 12 h 2 ( 5 s 4 + 34 s 2 + 9 ) 1 2 17 h 3 ( 33 s 5 + 410 s 3 + 405 s ) 1 2 20 h 4 ( 63 s 6 + 1260 s 4 + 2943 s 2 + 486 ) 1 2 25 h 5 ( 527 s 7 + 15617 s 5 + 69001 s 3 + 41607 s ) + .
15: 24.2 Definitions and Generating Functions
24.2.1 t e t 1 = n = 0 B n t n n ! , | t | < 2 π .
24.2.3 t e x t e t 1 = n = 0 B n ( x ) t n n ! , | t | < 2 π .
24.2.6 2 e t e 2 t + 1 = n = 0 E n t n n ! , | t | < 1 2 π ,
24.2.8 2 e x t e t + 1 = n = 0 E n ( x ) t n n ! , | t | < π ,
24.2.10 E n ( x ) = k = 0 n ( n k ) E k 2 k ( x 1 2 ) n k .
16: Bibliography Q
  • S.-L. Qiu and J.-M. Shen (1997) On two problems concerning means. J. Hangzhou Inst. Elec. Engrg. 17, pp. 17 (Chinese).
  • W. Qiu and R. Wong (2004) Asymptotic expansion of the Krawtchouk polynomials and their zeros. Comput. Methods Funct. Theory 4 (1), pp. 189–226.
  • C. K. Qu and R. Wong (1999) “Best possible” upper and lower bounds for the zeros of the Bessel function J ν ( x ) . Trans. Amer. Math. Soc. 351 (7), pp. 2833–2859.
  • 17: 3.4 Differentiation
    The Lagrange ( n + 1 ) -point formula is … where ξ 0 and ξ 1 I . For the values of n 0 and n 1 used in the formulas below …
    B 1 7 = 1 240 ( 144 360 t 48 t 2 + 260 t 3 45 t 4 30 t 5 + 7 t 6 ) ,
    With the choice r = k (which is crucial when k is large because of numerical cancellation) the integrand equals e k at the dominant points θ = 0 , 2 π , and in combination with the factor k k in front of the integral sign this gives a rough approximation to 1 / k ! . …
    18: 26.6 Other Lattice Path Numbers
    D ( m , n ) is the number of paths from ( 0 , 0 ) to ( m , n ) that are composed of directed line segments of the form ( 1 , 0 ) , ( 0 , 1 ) , or ( 1 , 1 ) . … M ( n ) is the number of lattice paths from ( 0 , 0 ) to ( n , n ) that stay on or above the line y = x and are composed of directed line segments of the form ( 2 , 0 ) , ( 0 , 2 ) , or ( 1 , 1 ) . … N ( n , k ) is the number of lattice paths from ( 0 , 0 ) to ( n , n ) that stay on or above the line y = x , are composed of directed line segments of the form ( 1 , 0 ) or ( 0 , 1 ) , and for which there are exactly k occurrences at which a segment of the form ( 0 , 1 ) is followed by a segment of the form ( 1 , 0 ) . … r ( n ) is the number of paths from ( 0 , 0 ) to ( n , n ) that stay on or above the diagonal y = x and are composed of directed line segments of the form ( 1 , 0 ) , ( 0 , 1 ) , or ( 1 , 1 ) . …
    26.6.6 n = 0 D ( n , n ) x n = 1 1 6 x + x 2 ,
    19: 7.17 Inverse Error Functions
    With t = 1 2 π x ,
    7.17.2 inverf x = t + 1 3 t 3 + 7 30 t 5 + 127 630 t 7 + = m = 0 a m t 2 m + 1 , | x | < 1 ,
    where a 0 = 1 and the other coefficients follow from the recursion
    7.17.2_5 a m + 1 = 1 2 m + 3 n = 0 m 2 n + 1 m n + 1 a n a m n , m = 0 , 1 , 2 , .
    7.17.3 inverfc x u 1 / 2 + a 2 u 3 / 2 + a 3 u 5 / 2 + a 4 u 7 / 2 + ,
    20: 26.2 Basic Definitions
    A partition of a nonnegative integer n is an unordered collection of positive integers whose sum is n . As an example, { 1 , 1 , 1 , 2 , 4 , 4 } is a partition of 13. …For the actual partitions ( π ) for n = 1 ( 1 ) 5 see Table 26.4.1. The integers whose sum is n are referred to as the parts in the partition. The example { 1 , 1 , 1 , 2 , 4 , 4 } has six parts, three of which equal 1. …