Rational Poly-Exponential Functions - Genocchi numbers
- Multisectioning by 1.
- Multisectioning by 2.
- Bottom Recurrence
- Top recurrence at 0
- Bottom Recurrence (low memory requirements)
- Top recurrence at 0 (low memory requirements)
- Multisectioning by 4.
- Multisectioning by 6.
- Multisectioning by 8.
- Multisectioning by 10.
- Multisectioning by 12.
- Multisectioning by 14.
- Multisectioning by 16.
- Multisectioning by 18.
- Bottom Recurrence
- Top recurrence at 0
- Top recurrence at 2
- Top recurrence at 4
- Top recurrence at 6
- Top recurrence at 8
- Top recurrence at 10
- Top recurrence at 12
- Top recurrence at 14
- Top recurrence at 16
- Bottom Recurrence (low memory requirements)
- Top recurrence at 0 (low memory requirements)
- Multisectioning by 20.
- Bottom Recurrence
- Top recurrence at 0
- Bottom Recurrence (low memory requirements)
- Top recurrence at 0 (low memory requirements)
Definition.
The Genocchi numbers are defined as the Gi in:
Some Recurrences
Some recurrences are worked out for your convenience. These files are stored as maple ".m" files. The denominator, when loaded, is the procedure "Bot", and the numerator, when loaded is the procedure "Top".Send comments to: kghare(at)cecm.sfu.ca