This page displays old graphics and numerics of work prior to publication in 2003 (i.e. it shows 'work in progress' from 1998-1999) by Rick Kreminski; you can send him email here. [A more detailed description is now available in Mathematics of Computation, specifically at 72 (2003), p.1379-1397, and more recent computations are posted here]

The Stieltjes constants k are essentially the coefficients in the Laurent expansion of the Riemann zeta function about s=1. More specifically,

defines k; the unsubscripted denotes Euler's constant, .577215... [A brief note on terminology: the k are often called generalized Euler constants, and were studied by Stieltjes; hence sometimes they are instead known as Stieltjes constants. But occasionally the entire coefficient of (s-1)k is called the kth Stieltjes constant. On this web page, we are interested in the values of the k, and we'll refer to them as "Stieltjes constants", since for one thing it's faster to write than "generalized Euler constants".]

The first graphic displays the first two hundred Stieltjes constants (or rather generalized Euler constants...), in the form of the logarithm of their absolute value:

[Graphics:test1gr2.gif][Graphics:test1gr1.gif]



Similar figure, now for the first eight hundred Stieltjes constants; note the remarkable smoothness in the growth:

[Graphics:test1gr4.gif]

Next, we consider the ratio of the log of the absolute value of k to k, first for all k from 1 to 800, then for k from 601 to 800; note the very regular "bumps":
[Graphics:test1gr6.gif]

[Graphics:test1gr2.gif][Graphics:test1gr7.gif]

[Graphics:test1gr8.gif]


The following figure indicates the ratio log(k)/k for those k's that are positive, for k=901 to 1000. This hopefully illustrates what we meant above by "very regular bumps":

Finally, we present some numerical values for k.
[These were obtained by taking much higher precision values and having Mathematica display their values to 10, then 9, digits; I suspect these are therefore rounded to 10 digits for the first 100 constants I display, i.e. for 1 to 100 then rounded to 9 digits for the last 100, i.e. for 701 to 800. I am undecided as to how many digits I should bother displaying for each k; values for k to over 200 digits for k=1 to 300, over 150 digits for k=301 to 600, over 115 digits for k=601 to k=900, and over 80 digits for k=901 to 1000 are available on another web site, if someone is interested. (That site will soon be updated to include k values through k=2000 to at least 110 digits, and up to k=2500 to at least 40 digits.) Here, I only supply high precision values for 100 (to over 630 digits), 800 (to over 350 digits), 1000 (to over 290 digits), 1400 (to over 200 digits), 2000 (to over 110 digits), 2200 (to over 110 digits), 2300 (to over 120 digits), and 2500 (to over 110 digits).]

[Graphics:test1gr9.gif]
Computing 100 to 350 digits originally took approximately 4 minutes on a 199Mhz Pentium with 32Meg RAM in early 1999; now (February 2000) the same calculation proceeds much more quickly, taking about two and a half minutes to compute over 630 digits on a 450Mhz AMD-K6-2 processor with 128 Meg RAM:
-4.2534015717080269623144385197278358247028931053473468971624319856362448710679\ 867205651086052814106715195749882958976789750898591896555161567278575754591633\ 510602349220343836317957923291060142502054299963101189538464028387645208320135\ 770277263936784464666489366935178005517582985352679311945779740238939109539440\ 150813707613443799022649298810844771963272297107416667390975959106029425547674\ 675094359574322842272172399135006180714297950066699954146292143720272856376667\ 260390929538757635592268693340635857870319494470399870863126646697863071842123\ 517967818664625916373136727079141593733831757956692975072181901822208317085801880557882449633... * 1017

[Graphics:test1gr11.gif]

800 to over 350 digits: 4.9135405617183059420222476712064847339402719362442113026262039583988755867359\ 438843536710158276178530113623827558756099110315231608329143854160511826736713\ 972748825417058128811885077912051573099693648643298975867506236706481259739136\ 781051694396048167782007042868700364513020589867259952638325774220295015424602\ 54437793490578438931448149800385820097079043...*10369

1000 to over 290 digits: -1.5709538442047449345494023425120825242380299554570342998059351161258294099037\ 199854206254096008467812139555341596736867502331601668121071638479052640676685\ 423545768534756544207985919676028379296947261650838972395390475634805777368274\ 19020885874953467487775260240930149416316567894812928130663644516...*10486

1400 to over 200 digits: -4.0972873342343532394982319461419806083647517955771025010419784982373402100149\ 505890244128631999143411495412251669307998124239956025361257600688130640693133926385598135692293832350098923754453616825523628...*10728

2200 to over 20 digits: -1.222869680592907845550881...*101241

The above four calculations each took less than three minutes; the calculation below took less than seven minutes. 2000 to over 110 digits: 2.680424678918000809504929834609356277409099264836410829548331346701687949728089727686622380790342607511360733839...*101109

2200 to over 90 digits also took less than seven minutes, but nearly 8 minutes to get over 110 digits: -1.2228696805929078455508813376738703168396086351823059289770185794935419511856\ 18477984871036539175221112890314370286032444... *101241

2300 to over 120 digits: 8.2283687746543004407015965275604433206784689826434521673412393372454407360957\ 6441279096701958066765438702305269666273908142400931... *101306

2500 to over 110 digits: 3.09222595656080208627358480085517110069857920869644722628396987113619118879848205835658417632121267290063723892135022544042321... *101439

The sign pattern for the first eight hundred constants is very orderly; here are their signs, in the form of a listing of the length of the "runs" of negatives and positives. More specifically, the listing below indicates that the first two values (i.e. 1 and 2) are negative, then the next three are positive, and so on, until the last eight computed in the listing above (i.e. 793 to 800 are seen to be positive):
2,3,4,3,4,5,4,5,5,5,5,5,6,6,5,6,6,6,6,6, 7,6,7,6,7,6,7,7,7,7,7,7,7,7,8,7,7,8,7,8, 7,8,7,8,8,7,8,8,8,8,8,8,8,8,8,8,8,8,8,9, 8,8,9,8,8,9,8,9,8,9,8,9,9,8,9,9,8,9,9,9, 8,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,10,9,9, 9,10,9,9,9,8...

This page supplies a sample of some of the structure in the growth of the Stieltjes constants. Related structure appears in the growth of the generalized Stieltjes constants (i.e., up to normalization, the Laurent series coefficients for the Riemann-Hurwitz zeta function). Our method allows for computation of the Taylor coefficients for the zeta and the Riemann-Hurwitz zeta functions about other points besides s=1. Again, anyone interested in any of these computational matters can request a preprint using the email link at the top of the page.