Schr%C3%order%20numbers

SearchAdvancedHelp

(0.002 seconds)

11—20 of 434 matching pages

11: 24.14 Sums

§24.14 Sums

►

§24.14(i) Quadratic Recurrence Relations

… ►

§24.14(ii) Higher-Order Recurrence Relations

… ►These identities can be regarded as higher-order recurrences. … ►For other sums involving Bernoulli and Euler numbers and polynomials see Hansen (1975, pp. 331–347) and Prudnikov et al. (1990, pp. 383–386).

12: 26.11 Integer Partitions: Compositions

… ►A composition is an integer partition in which order is taken into account. …$c\left(n\right)$ denotes the number of compositions of $n$, and $c_m\left(n\right)$ is the number of compositions into exactly $m$ parts. $c(\in T,n)$ is the number of compositions of $n$ with no 1’s, where again $T=\{2,3,4,\mathrm{\dots }\}$. … ►The Fibonacci numbers are determined recursively by … ►Additional information on Fibonacci numbers can be found in Rosen et al. (2000, pp. 140–145).

13: 10.3 Graphics

… ►

§10.3(i) Real Order and Variable

… ►

§10.3(ii) Real Order, Complex Variable

… ►

§10.3(iii) Imaginary Order, Real Variable

… ►

►►

Figure 10.3.18: ${\tilde{J}}_1\left(x\right)$, ${\tilde{Y}}_1\left(x\right)$, $0.01\le x\le 10$. Magnify

►

►►

Figure 10.3.19: ${\tilde{J}}_5\left(x\right)$, ${\tilde{Y}}_5\left(x\right)$, $0.01\le x\le 10$. Magnify

14: Bibliography

… ►

Polygamma functions of negative order. J. Comput. Appl. Math. 100 (2), pp. 191–199.

ⓘ

External Links:

ISSN 0377-0427, Document, MathReview, ZentralBlatt

Referenced by:

(25.11.32), (25.11.34), §25.11(viii).

Encodings:

BibTeX

… ►

On the degrees of irreducible factors of higher order Bernoulli polynomials. Acta Arith. 62 (4), pp. 329–342.

ⓘ

External Links:

ISSN 0065-1036, Pdf, MathReview (L. Skula), ZentralBlatt

Referenced by:

§24.12(iii).

Encodings:

BibTeX

►

Congruences of $p$-adic integer order Bernoulli numbers. J. Number Theory 59 (2), pp. 374–388.

ⓘ

External Links:

ISSN 0022-314X, Document, MathReview (L. Skula), ZentralBlatt

Referenced by:

§24.16(iii).

Encodings:

BibTeX

… ►

Algorithm 804: Subroutines for the computation of Mathieu functions of integer orders. ACM Trans. Math. Software 26 (3), pp. 408–414.

ⓘ

Notes:

Double-precision C++, minimum accuracy 14D

External Links:

ISSN 0098-3500, Document, GAMS (module 804; package TOMS)

Referenced by:

1st item, 1st item.

Encodings:

BibTeX

… ►

A subroutine package for Bessel functions of a complex argument and nonnegative order. Technical Report Technical Report SAND85-1018, Sandia National Laboratories, Albuquerque, NM.

ⓘ

External Links:

FullText

Referenced by:

1st item, B. Döring (1966).

Encodings:

BibTeX

…

15: 26.5 Lattice Paths: Catalan Numbers

§26.5 Lattice Paths: Catalan Numbers

►

§26.5(i) Definitions

► $C\left(n\right)$ is the Catalan number. … ►

§26.5(ii) Generating Function

… ►

§26.5(iii) Recurrence Relations

…

16: Bibliography O

… ►

Hyperasymptotic solutions of second-order linear differential equations. I. Methods Appl. Anal. 2 (2), pp. 173–197.

ⓘ

External Links:

ISSN 1073-2772, FullText, MathReview (A. D. Wood), ZentralBlatt

Referenced by:

§10.17(v), §10.40(iv), §13.29(i), §13.7(iii), §2.11(v), §9.7(v).

Encodings:

BibTeX

►

On the calculation of Stokes multipliers for linear differential equations of the second order. Methods Appl. Anal. 2 (3), pp. 348–367.

ⓘ

External Links:

ISSN 1073-2772, Pdf, MathReview (Archibald D. MacGillivray), ZentralBlatt

Referenced by:

§2.7(ii).

Encodings:

BibTeX

… ►

Hyperasymptotic solutions of second-order linear differential equations. II. Methods Appl. Anal. 2 (2), pp. 198–211.

ⓘ

External Links:

ISSN 1073-2772, FullText, MathReview (A. D. Wood), ZentralBlatt

Referenced by:

§10.17(v), §10.40(iv), §2.11(v), §9.7(v).

Encodings:

BibTeX

… ►

Connection formulas for second-order differential equations having an arbitrary number of turning points of arbitrary multiplicities. SIAM J. Math. Anal. 8 (4), pp. 673–700.

ⓘ

External Links:

Document, MathReview (W. Wasow), ZentralBlatt

Referenced by:

§2.8(v).

Encodings:

BibTeX

►

Second-order differential equations with fractional transition points. Trans. Amer. Math. Soc. 226, pp. 227–241.

ⓘ

External Links:

FullText, MathReview (Anthony Leung), ZentralBlatt

Referenced by:

§2.8(v).

Encodings:

BibTeX

…

17: Bibliography N

… ►

Reduction and evaluation of elliptic integrals. Math. Comp. 20 (94), pp. 223–231.

ⓘ

External Links:

FullText, MathReview (I. A. Stegun), ZentralBlatt

Referenced by:

§19.37(iv).

Encodings:

BibTeX

… ►

The resurgence properties of the large order asymptotics of the Anger-Weber function I. J. Class. Anal. 4 (1), pp. 1–39.

ⓘ

External Links:

ISSN 1848-5979, Document, Link, MathReview (José Luis López), ZentralBlatt

Referenced by:

(11.11.10), (11.11.8), §11.11(iii).

Encodings:

BibTeX

►

The resurgence properties of the large order asymptotics of the Anger-Weber function II. J. Class. Anal. 4 (2), pp. 121–147.

ⓘ

External Links:

ISSN 1848-5979, Document, Link, MathReview Entry, ZentralBlatt

Referenced by:

(11.11.10), (11.11.8), §11.11(iii).

Encodings:

BibTeX

… ►

Uniform Asymptotic Approximations of Solutions of Second-order Linear Differential Equations, with a Coalescing Simple Turning Point and Simple Pole. Ph.D. Thesis, University of Maryland, College Park, MD.

ⓘ

Referenced by:

§2.8(vi).

Encodings:

BibTeX

… ►

ⓘ

Notes:

References and links to software for factorization and primality testing.

External Links:

Home Page

Referenced by:

6th item.

Encodings:

BibTeX

…

18: 26.3 Lattice Paths: Binomial Coefficients

… ► $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$ is the number of ways of choosing $n$ objects from a collection of $m$ distinct objects without regard to order. $\left(\genfrac{}{}{0.0pt}{}{m+n}{n}\right)$ is the number of lattice paths from $(0,0)$ to $(m,n)$. …The number of lattice paths from $(0,0)$ to $(m,n)$, $m\le n$, that stay on or above the line $y=x$ is $\left(\genfrac{}{}{0.0pt}{}{m+n}{m}\right)-\left(\genfrac{}{}{0.0pt}{}{m+n}{m-1}\right).$ … ►

Table 26.3.1: Binomial coefficients $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$.

► ►►►

$m$	$n$
	…
6	1	6	15	20	15	6	1
…

►

►

Table 26.3.2: Binomial coefficients $\left(\genfrac{}{}{0.0pt}{}{m+n}{m}\right)$ for lattice paths.

► ►►►

$m$	$n$
	…
3	1	4	10	20	35	56	84	120	165
…

►

…

19: Bibliography D

… ►

A simplified algorithm for the second-order sound fields. J. Acoust. Soc. Amer. 108 (6), pp. 2759–2764.

ⓘ

External Links:

Document

Referenced by:

§8.24(iii).

Encodings:

BibTeX

… ►

Bessel functions $J_n(z)$ and $Y_n(z)$ of integer order and complex argument. Comput. Phys. Comm. 78 (1-2), pp. 181–189.

ⓘ

Notes:

Double-precision Pascal, maximum accuracy 7D.

External Links:

ISSN 0010-4655, Document, Code, MathReview (J. P. Singhal), ZentralBlatt

Referenced by:

2nd item.

Encodings:

BibTeX

… ►

Uniform asymptotic expansions for associated Legendre functions of large order. Proc. Roy. Soc. Edinburgh Sect. A 133 (4), pp. 807–827.

ⓘ

External Links:

ISSN 0308-2105, Document, MathReview, ZentralBlatt

Referenced by:

§14.15(i), §14.15(i), §14.15(ii), §14.15(ii), §14.26.

Encodings:

BibTeX

… ►

Conical functions of purely imaginary order and argument. Proc. Roy. Soc. Edinburgh Sect. A 143 (5), pp. 929–955.

ⓘ

External Links:

ISSN 0308-2105, Document, Link, MathReview (Eugenia N. Petropoulou), ZentralBlatt

Referenced by:

§14.20(ix), §14.20(ix).

Encodings:

BibTeX

… ►

A survey on orthogonal matrix polynomials satisfying second order differential equations. J. Comput. Appl. Math. 178 (1-2), pp. 169–190.

ⓘ

External Links:

ISSN 0377-0427, Document, MathReview, ZentralBlatt

Referenced by:

§18.36(iv).

Encodings:

BibTeX

…

20: 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 $(modm)$, which is correct to 20 digits. …