B. V. Saunders and Q. Wang (2005) Boundary/Contour Fitted Grid Generation for Effective Visualizations in a Digital Library of Mathematical Functions, Proceedings of the 9th International Conference on Numerical Grid Generation in Computational Field Simulations, San Jose, June 11–18, 2005. pp. 61–71.

►

Q. Wang and B. V. Saunders (2005) Web-Based 3D Visualization in a Digital Library of Mathematical Functions, Proceedings of the Web3D Symposium, Bangor, UK, March 29–April 1, 2005.

►

B. V. Saunders and Q. Wang (2006) From B-Spline Mesh Generation to Effective Visualizations for the NIST Digital Library of Mathematical Functions, in Curve and Surface Design, Proceedings of the Sixth International Conference on Curves and Surfaces, Avignon, France June 29–July 5, 2006, pp. 235–243.

…

6: 26.2 Basic Definitions

… ►

Table 26.2.1: Partitions

p\left(n\right)

► ►►►►►►

$n$	$p\left(n\right)$	$n$	$p\left(n\right)$	$n$	$p\left(n\right)$
…
6	11	23	1255	40	37338
…
10	42	27	3010	44	75175
11	56	28	3718	45	89134
12	77	29	4565	46	1 05558
…

►

7: 26.9 Integer Partitions: Restricted Number and Part Size

… ►

Table 26.9.1: Partitions

p_{k}\left(n\right)

► ►►►►►►►

$n$	$k$
$n$	0	1	2	3	4	5	6	7	8	9	10
…
6	0	1	4	7	9	10	11	11	11	11	11
7	0	1	4	8	11	13	14	15	15	15	15
8	0	1	5	10	15	18	20	21	22	22	22
9	0	1	5	12	18	23	26	28	29	30	30
…

► …

8: 25.20 Approximations

… ►

•

Cody et al. (1971) gives rational approximations for $\zeta\left(s\right)$ in the form of quotients of polynomials or quotients of Chebyshev series. The ranges covered are $0.5\leq s\leq 5$ , $5\leq s\leq 11$ , $11\leq s\leq 25$ , $25\leq s\leq 55$ . Precision is varied, with a maximum of 20S.

… ►

•

Antia (1993) gives minimax rational approximations for $\Gamma\left(s+1\right)F_{s}(x)$ , where $F_{s}(x)$ is the Fermi–Dirac integral (25.12.14), for the intervals $-\infty<x\leq 2$ and $2\leq x<\infty$ , with $s=-\frac{1}{2},\frac{1}{2},\frac{3}{2},\frac{5}{2}$ . For each $s$ there are three sets of approximations, with relative maximum errors $10^{-4},10^{-8},10^{-12}$ .

9: 27.2 Functions

… ►

Table 27.2.1: Primes.

► ►►►►

$n$	$p_{n}$	$p_{n+10}$	$p_{n+20}$	$p_{n+30}$	$p_{n+40}$	$p_{n+50}$	$p_{n+60}$	$p_{n+70}$	$p_{n+80}$	$p_{n+90}$
…
5	11	47	97	149	197	257	313	379	439	499
…
10	29	71	113	173	229	281	349	409	463	541

► ►

Table 27.2.2: Functions related to division.

► ►►►►►

$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$
…
3	2	2	4	16	8	5	31	29	28	2	30	42	12	8	96
…
9	6	3	13	22	10	4	36	35	24	4	48	48	16	10	124
…
11	10	2	12	24	8	8	60	37	36	2	38	50	20	6	93
…

►

10: 24.20 Tables

… ►Abramowitz and Stegun (1964, Chapter 23) includes exact values of

\sum_{k=1}^{m}k^{n}

m=1(1)100

n=1(1)10

;

\sum_{k=1}^{\infty}k^{-n}

\sum_{k=1}^{\infty}(-1)^{k-1}k^{-n}

\sum_{k=0}^{\infty}(2k+1)^{-n}

n=1,2,\dotsc

, 20D;

\sum_{k=0}^{\infty}(-1)^{k}(2k+1)^{-n}

n=1,2,\dotsc

, 18D. … ►For information on tables published before 1961 see Fletcher et al. (1962, v. 1, §4) and Lebedev and Fedorova (1960, Chapters 11 and 14).

.奥乔亚世界杯扑救『网址:mxsty.cc』.世界杯亚运会.m4x5s2-2022年11月29日4时50分10秒eosssivzt

1—10 of 241 matching pages

1: 10 Bessel Functions

Chapter 10 Bessel Functions

2: 11 Struve and Related Functions

Chapter 11 Struve and Related Functions

3: 29 Lamé Functions

Chapter 29 Lamé Functions

4: Staff

5: Publications

6: 26.2 Basic Definitions

7: 26.9 Integer Partitions: Restricted Number and Part Size

8: 25.20 Approximations

9: 27.2 Functions

10: 24.20 Tables

$n$	$k$
$n$	0	1	2	3	4	5	6	7	8	9	10
…
6	0	1	4	7	9	10	11	11	11	11	11
7	0	1	4	8	11	13	14	15	15	15	15
8	0	1	5	10	15	18	20	21	22	22	22
9	0	1	5	12	18	23	26	28	29	30	30
…

$n$	$p_{n}$	$p_{n+10}$	$p_{n+20}$	$p_{n+30}$	$p_{n+40}$	$p_{n+50}$	$p_{n+60}$	$p_{n+70}$	$p_{n+80}$	$p_{n+90}$
…
5	11	47	97	149	197	257	313	379	439	499
…
10	29	71	113	173	229	281	349	409	463	541

$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$
…
3	2	2	4	16	8	5	31	29	28	2	30	42	12	8	96
…
9	6	3	13	22	10	4	36	35	24	4	48	48	16	10	124
…
11	10	2	12	24	8	8	60	37	36	2	38	50	20	6	93
…

$n$	$k$
$n$	0	1	2	3	4	5	6	7	8	9	10
…
6	0	1	4	7	9	10	11	11	11	11	11
7	0	1	4	8	11	13	14	15	15	15	15
8	0	1	5	10	15	18	20	21	22	22	22
9	0	1	5	12	18	23	26	28	29	30	30
…

$n$	$p_{n}$	$p_{n+10}$	$p_{n+20}$	$p_{n+30}$	$p_{n+40}$	$p_{n+50}$	$p_{n+60}$	$p_{n+70}$	$p_{n+80}$	$p_{n+90}$
…
5	11	47	97	149	197	257	313	379	439	499
…
10	29	71	113	173	229	281	349	409	463	541

$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$
…
3	2	2	4	16	8	5	31	29	28	2	30	42	12	8	96
…
9	6	3	13	22	10	4	36	35	24	4	48	48	16	10	124
…
11	10	2	12	24	8	8	60	37	36	2	38	50	20	6	93
…

$n$	$k$
$n$	0	1	2	3	4	5	6	7	8	9	10
…
6	0	1	4	7	9	10	11	11	11	11	11
7	0	1	4	8	11	13	14	15	15	15	15
8	0	1	5	10	15	18	20	21	22	22	22
9	0	1	5	12	18	23	26	28	29	30	30
…

$n$	$p_{n}$	$p_{n+10}$	$p_{n+20}$	$p_{n+30}$	$p_{n+40}$	$p_{n+50}$	$p_{n+60}$	$p_{n+70}$	$p_{n+80}$	$p_{n+90}$
…
5	11	47	97	149	197	257	313	379	439	499
…
10	29	71	113	173	229	281	349	409	463	541

$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$	$n$	$\phi\left(n\right)$	$d\left(n\right)$	$\sigma\left(n\right)$
…
3	2	2	4	16	8	5	31	29	28	2	30	42	12	8	96
…
9	6	3	13	22	10	4	36	35	24	4	48	48	16	10	124
…
11	10	2	12	24	8	8	60	37	36	2	38	50	20	6	93
…