About the Project

binomial expansion

AdvancedHelp

(0.002 seconds)

21—22 of 22 matching pages

21: 26.8 Set Partitions: Stirling Numbers
26.8.16 s ( n , n 1 ) = S ( n , n 1 ) = ( n 2 ) ,
26.8.19 ( k h ) s ( n , k ) = j = k h n h ( n j ) s ( n j , h ) s ( j , k h ) , n k h ,
26.8.23 ( k h ) S ( n , k ) = j = k h n h ( n j ) S ( n j , h ) S ( j , k h ) , n k h ,
26.8.25 S ( n + 1 , k + 1 ) = j = k n ( n j ) S ( j , k ) ,
For other asymptotic approximations and also expansions see Moser and Wyman (1958a) for Stirling numbers of the first kind, and Moser and Wyman (1958b), Bleick and Wang (1974) for Stirling numbers of the second kind. …
22: 24.16 Generalizations
For extensions of B n ( ) ( x ) to complex values of x , n , and , and also for uniform asymptotic expansions for large x and large n , see Temme (1995b) and López and Temme (1999b, 2010b). …
24.16.11 B n , χ ( x ) = k = 0 n ( n k ) B k , χ x n k .