Cash App Phone Number%E2%98%8E%EF%B8%8F%2B1%28888%E2%80%92481%E2%80%924477%29%E2%98%8E%EF%B8%8F %22Number%22

SearchAdvancedHelp

Did you mean Cash App honneur Number%E2%98%8E%EF%B8%8F%2B1%2888%E2%80%2481%E2%80%92478%29%E2%98%8E%EF%B8%8F %22Number%22 ?

(0.019 seconds)

1—10 of 859 matching pages

1: 24.1 Special Notation

… ►

Bernoulli Numbers and Polynomials

►The origin of the notation $B_n$, $B_n\left(x\right)$, is not clear. … ►

Euler Numbers and Polynomials

… ►Its coefficients were first studied in Euler (1755); they were called Euler numbers by Raabe in 1851. The notations $E_n$, $E_n\left(x\right)$, as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …

2: Bibliography C

… ►

Some congruences for the Bernoulli numbers. Amer. J. Math. 75 (1), pp. 163–172.

ⓘ

External Links:

FullText, MathReview (A. L. Whiteman), ZentralBlatt

Referenced by:

§24.10(i).

Encodings:

BibTeX

►

$q$-Bernoulli and Eulerian numbers. Trans. Amer. Math. Soc. 76 (2), pp. 332–350.

ⓘ

External Links:

FullText, MathReview (A. L. Whiteman), ZentralBlatt

Referenced by:

§17.3(iii), §24.16(iii).

Encodings:

BibTeX

►

A note on Euler numbers and polynomials. Nagoya Math. J. 7, pp. 35–43.

ⓘ

External Links:

MathReview (A. L. Whiteman), ZentralBlatt

Referenced by:

§24.10(iv).

Encodings:

BibTeX

►

Expansions of $q$-Bernoulli numbers. Duke Math. J. 25 (2), pp. 355–364.

ⓘ

External Links:

Document, MathReview (A. L. Whiteman), ZentralBlatt

Referenced by:

§17.3(iii).

Encodings:

BibTeX

… ►

A Unified Approach to Recurrence Algorithms. In Approximation and Computation (West Lafayette, IN, 1993), R. V. M. Zahar (Ed.), International Series of Computational Mathematics, Vol. 119, pp. 97–120.

ⓘ

External Links:

ISBN 0-8176-3753-2, MathReview (R. M. M. Mattheij), ZentralBlatt

Referenced by:

§3.6(vii).

Encodings:

BibTeX

…

3: 3.6 Linear Difference Equations

… ►The Weber function ${𝐄}_n\left(1\right)$ satisfies …We apply the algorithm to compute ${𝐄}_n\left(1\right)$ to 8S for the range $n=1,2,\mathrm{\dots },10$, beginning with the value ${𝐄}_0\left(1\right)=-\mathrm{0.56865\hspace{0.33em}\hspace{0.17em}663}$ obtained from the Maclaurin series expansion (§11.10(iii)). ►In the notation of §3.6(v) we have $M=10$ and $ϵ=\frac{1}{2}\times {10}^{-8}$. …The values of $w_n$ for $n=1,2,\mathrm{\dots },10$ are the wanted values of ${𝐄}_n\left(1\right)$. … ►For further information see Wimp (1984, Chapters 7–8), Cash and Zahar (1994), and Lozier (1980).

4: DLMF Project News

error generating summary

5: 24.15 Related Sequences of Numbers

§24.15 Related Sequences of Numbers

►

§24.15(i) Genocchi Numbers

… ►

§24.15(ii) Tangent Numbers

… ►

§24.15(iii) Stirling Numbers

… ►

§24.15(iv) Fibonacci and Lucas Numbers

…

6: 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

…

7: 27.2 Functions

… ►

§27.2(i) Definitions

… ►where $p_1,p_2,\mathrm{\dots },p_{\nu \left(n\right)}$ are the distinct prime factors of $n$, each exponent $a_r$ is positive, and $\nu \left(n\right)$ is the number of distinct primes dividing $n$. … ►(See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) … ► … ►

§27.2(ii) Tables

…

8: 26.11 Integer Partitions: Compositions

… ►For example, there are eight compositions of 4: $4,3+1,1+3,2+2,2+1+1,1+2+1,1+1+2$, and $1+1+1+1$. $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).

9: 27.18 Methods of Computation: Primes

§27.18 Methods of Computation: Primes

►An overview of methods for precise counting of the number of primes not exceeding an arbitrary integer $x$ is given in Crandall and Pomerance (2005, §3.7). …An analytic approach using a contour integral of the Riemann zeta function (§25.2(i)) is discussed in Borwein et al. (2000). … ►These algorithms are used for testing primality of Mersenne numbers, $2^n-1$, and Fermat numbers, $2^{2^n}+1$. …

10: 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

…