Intended for: July 10, 2012
Timetable
 First draft entered by Frank Ellerman on April 20, 2011 ✓
 Draft reviewed by Daniel Forgues on July 8, 2011 ✓
 Draft approved by Alonso del Arte on June 9, 2011 ✓
The line below marks the end of the <noinclude> ... </noinclude> section.
A060851:
(2 n − 1) 3 2 n − 1, n ≥ 1 
.

{ 3, 81, 1215, 15309, 177147, 1948617, ... }
Simon Plouffe published a helpful
list of odd zeta values from
up to
with a precision of 1000 decimal digits—an older version of this list also covered
,
and
and is now available in separate files with more digits. You could
hardwire these values in projects (e.g.
RxShell (ZETA and RX.MATH)) where computing
small odd
values on the fly is no option, because it would take far too long. The odd
values can be used to determine
Euler’s constant among other things.
A060851 can then help to verify computed values for Euler’s
(usually referred to as
(
gamma) or
Euler–Mascheroni constant),
Apéry’s constant , or
log 2 after dynamic changes of the chosen precision, e.g.,
Open Object Rexx NUMERIC DIGITS 500
.