|
| |
|
|
A084945
|
|
Decimal expansion of Golomb-Dickman constant.
|
|
2
| |
|
|
6, 2, 4, 3, 2, 9, 9, 8, 8, 5, 4, 3, 5, 5, 0, 8, 7, 0, 9, 9, 2, 9, 3, 6, 3, 8, 3, 1, 0, 0, 8, 3, 7, 2, 4, 4, 1, 7, 9, 6, 4, 2, 6, 2, 0, 1, 8, 0, 5, 2, 9, 2, 8, 6, 9, 7, 3, 5, 5, 1, 9, 0, 2, 4, 9, 5, 6, 3, 8, 0, 8, 8, 8, 5, 5, 1, 1, 3, 2, 5, 4, 4, 6, 2, 4, 6, 0, 2, 7, 6, 1, 9, 5, 5, 3, 9, 8, 6, 8, 8, 6, 9
(list; constant; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| The first 27 digits form a prime. - Jonathan Vos Post, Nov 12 2004
The first 1659 digits form a prime. [From David Broadhurst, Apr 02 2010]
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Golomb-Dickman Constant
Simon Plouffe, The Golomb constant
PrimeForm message on the first 1659 digits. [From David Broadhurst, Apr 02 2010]
Wikipedia, Golomb-Dickman constant
|
|
|
EXAMPLE
| 0.62432998854355087...
|
|
|
MAPLE
| E1:= z-> int (exp(-t)/t, t=z..infinity):
lambda:= int (exp(-x-E1(x)), x=0..infinity):
s:= convert (evalf (lambda, 130), string):
seq (parse (s[n+1]), n=1..120); # Alois P. Heinz, Nov 20 2011
|
|
|
MATHEMATICA
| NIntegrate[Exp[LogIntegral[x]], {x, 0, 1}, WorkingPrecision->110, MaxRecursion->20]
|
|
|
CROSSREFS
| Sequence in context: A198502 A064925 A173273 * A010493 A175286 A061496
Adjacent sequences: A084942 A084943 A084944 * A084946 A084947 A084948
|
|
|
KEYWORD
| nonn,cons
|
|
|
AUTHOR
| Eric Weisstein (eric(AT)weisstein.com), Jun 13 2003
|
| |
|
|
