About the Project

Narayana numbers

AdvancedHelp

(0.001 seconds)

31—40 of 223 matching pages

31: 27.21 Tables
§27.21 Tables
Bressoud and Wagon (2000, pp. 103–104) supplies tables and graphs that compare π ( x ) , x / ln x , and li ( x ) . … Lehmer (1941) gives a comprehensive account of tables in the theory of numbers, including virtually every table published from 1918 to 1941. … No sequel to Lehmer (1941) exists to date, but many tables of functions of number theory are included in Unpublished Mathematical Tables (1944).
32: 4.19 Maclaurin Series and Laurent Series
In (4.19.3)–(4.19.9), B n are the Bernoulli numbers and E n are the Euler numbers (§§24.2(i)24.2(ii)).
4.19.3 tan z = z + z 3 3 + 2 15 z 5 + 17 315 z 7 + + ( 1 ) n 1 2 2 n ( 2 2 n 1 ) B 2 n ( 2 n ) ! z 2 n 1 + , | z | < 1 2 π ,
4.19.4 csc z = 1 z + z 6 + 7 360 z 3 + 31 15120 z 5 + + ( 1 ) n 1 2 ( 2 2 n 1 1 ) B 2 n ( 2 n ) ! z 2 n 1 + , 0 < | z | < π ,
4.19.5 sec z = 1 + z 2 2 + 5 24 z 4 + 61 720 z 6 + + ( 1 ) n E 2 n ( 2 n ) ! z 2 n + , | z | < 1 2 π ,
4.19.6 cot z = 1 z z 3 z 3 45 2 945 z 5 ( 1 ) n 1 2 2 n B 2 n ( 2 n ) ! z 2 n 1 , 0 < | z | < π ,
33: 24.4 Basic Properties
§24.4(iv) Finite Expansions
24.4.15 B 2 n = 2 n 2 2 n ( 2 2 n 1 ) k = 0 n 1 ( 2 n 1 2 k ) E 2 k ,
24.4.16 E 2 n = 1 2 n + 1 k = 1 n ( 2 n 2 k 1 ) 2 2 k ( 2 2 k 1 1 ) B 2 k k ,
§24.4(ix) Relations to Other Functions
For the relation of Bernoulli numbers to the Riemann zeta function see §25.6, and to the Eulerian numbers see (26.14.11).
34: 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
35: 27.14 Unrestricted Partitions
Euler’s pentagonal number theorem states that …where the exponents 1 , 2 , 5 , 7 , 12 , 15 , are the pentagonal numbers, defined by … For example, the Ramanujan identity …
§27.14(vi) Ramanujan’s Tau Function
36: How to Cite
If you mention a specific equation (or chapter, section, …), you’ll help your readers find it by using our Permalinks & Reference numbers. …produces pdf with the equation and table numbers linking directly into the DLMF website: …
Permalinks & Reference numbers
The direct correspondence between the reference numbers in the printed Handbook and the permalinks used online in the DLMF enables readers of either version to cite specific items and their readers to easily look them up again — in either version! The following table outlines the correspondence between reference numbers as they appear in the Handbook, and the URL’s that find the same item online. …
37: 27.15 Chinese Remainder Theorem
§27.15 Chinese Remainder Theorem
This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …Their product m has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result ( mod m ) , which is correct to 20 digits. …
38: 27 Functions of Number Theory
Chapter 27 Functions of Number Theory
39: Karl Dilcher
Dilcher’s research interests include classical analysis, special functions, and elementary, combinatorial, and computational number theory. Over the years he authored or coauthored numerous papers on Bernoulli numbers and related topics, and he maintains a large on-line bibliography on the subject. …
40: 27.8 Dirichlet Characters
§27.8 Dirichlet Characters
An example is the principal character (mod k ): … If ( n , k ) = 1 , then the characters satisfy the orthogonality relationA divisor d of k is called an induced modulus for χ if … If k is odd, then the real characters (mod k ) are the principal character and the quadratic characters described in the next section.