Algorithms for Bernoulli numbers and Euler numbers (Q2736388)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for Bernoulli numbers and Euler numbers |
scientific article; zbMATH DE number 1638691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for Bernoulli numbers and Euler numbers |
scientific article; zbMATH DE number 1638691 |
Statements
29 August 2001
0 references
Euler numbers
0 references
Stirling numbers of the second kind
0 references
tangent numbers
0 references
Bernoulli numbers
0 references
recursive algorithms
0 references
Algorithms for Bernoulli numbers and Euler numbers (English)
0 references
The author proposes new recursive algorithms which produce Bernoulli numbers, Euler numbers, and tangent numbers. Expressions of the Euler numbers and tangent numbers in terms of Stirling numbers of the second kind are also found.
0 references
0.8203809857368469
0 references
0.8193708062171936
0 references
0.795457661151886
0 references
0.7911298871040344
0 references
0.7895027995109558
0 references
