About the Project

number%20of

AdvancedHelp

(0.002 seconds)

11—20 of 42 matching pages

11: 24.2 Definitions and Generating Functions
§24.2 Definitions and Generating Functions
§24.2(i) Bernoulli Numbers and Polynomials
§24.2(ii) Euler Numbers and Polynomials
Table 24.2.1: Bernoulli and Euler numbers.
n B n E n
12: 26.6 Other Lattice Path Numbers
§26.6 Other Lattice Path Numbers
Delannoy Number D ( m , n )
Motzkin Number M ( n )
Narayana Number N ( n , k )
§26.6(iv) Identities
13: 26.2 Basic Definitions
The total number of partitions of n is denoted by p ( n ) . …
Table 26.2.1: Partitions p ( n ) .
n p ( n ) n p ( n ) n p ( n )
3 3 20 627 37 21637
14: Bibliography I
  • K. Inkeri (1959) The real roots of Bernoulli polynomials. Ann. Univ. Turku. Ser. A I 37, pp. 1–20.
  • K. Ireland and M. Rosen (1990) A Classical Introduction to Modern Number Theory. 2nd edition, Springer-Verlag, New York.
  • 15: 5.11 Asymptotic Expansions
    5.11.1 Ln Γ ( z ) ( z 1 2 ) ln z z + 1 2 ln ( 2 π ) + k = 1 B 2 k 2 k ( 2 k 1 ) z 2 k 1
    5.11.2 ψ ( z ) ln z 1 2 z k = 1 B 2 k 2 k z 2 k .
    For the Bernoulli numbers B 2 k , see §24.2(i). … Wrench (1968) gives exact values of g k up to g 20 . …For explicit formulas for g k in terms of Stirling numbers see Nemes (2013a), and for asymptotic expansions of g k as k see Boyd (1994) and Nemes (2015a). …
    16: Peter L. Walker
    Walker’s published work has been mainly in real and complex analysis, with excursions into analytic number theory and geometry, the latter in collaboration with Professor Mowaffaq Hajja of the University of Jordan. …
  • 17: Software Index
    Open Source With Book Commercial
    20 Theta Functions
    24.21(ii) B n , B n ( x ) , E n , E n ( x ) a Derive, MuPAD
    27 Functions of Number Theory
  • Software Associated with Books.

    An increasing number of published books have included digital media containing software described in the book. Often, the collection of software covers a fairly broad area. Such software is typically developed by the book author. While it is not professionally packaged, it often provides a useful tool for readers to experiment with the concepts discussed in the book. The software itself is typically not formally supported by its authors.

  • 18: 26.10 Integer Partitions: Other Restrictions
    p ( 𝒟 , n ) denotes the number of partitions of n into distinct parts. p m ( 𝒟 , n ) denotes the number of partitions of n into at most m distinct parts. p ( 𝒟 k , n ) denotes the number of partitions of n into parts with difference at least k . … p ( 𝒪 , n ) denotes the number of partitions of n into odd parts. p ( S , n ) denotes the number of partitions of n into parts taken from the set S . …
    19: 26.12 Plane Partitions
    Then the number of plane partitions in B ( r , s , t ) is … The number of symmetric plane partitions in B ( r , r , t ) is … The number of cyclically symmetric plane partitions in B ( r , r , r ) is … The number of descending plane partitions in B ( r , r , r ) is …
    20: Bibliography
  • M. J. Ablowitz and H. Segur (1977) Exact linearization of a Painlevé transcendent. Phys. Rev. Lett. 38 (20), pp. 1103–1106.
  • A. Adelberg (1992) On the degrees of irreducible factors of higher order Bernoulli polynomials. Acta Arith. 62 (4), pp. 329–342.
  • A. Adelberg (1996) Congruences of p -adic integer order Bernoulli numbers. J. Number Theory 59 (2), pp. 374–388.
  • D. E. Amos (1989) Repeated integrals and derivatives of K Bessel functions. SIAM J. Math. Anal. 20 (1), pp. 169–175.
  • T. M. Apostol (2000) A Centennial History of the Prime Number Theorem. In Number Theory, Trends Math., pp. 1–14.