|
|
A007447
|
|
Logarithm of e.g.f. for primes.
(Formerly M0159)
|
|
10
|
|
|
2, -1, 3, -12, 59, -354, 2535, -21190, 202731, -2183462, 26130441, -343956264, 4938891841, -76827253854, 1287026203647, -23100628140676, 442271719973507, -8996704216880580, 193776558133638811, -4405549734148088108, 105432710994387193283, -2649353692976978990070
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
E.g.f.: log(1 + Sum_{k>=1} prime(k)*x^k/k!). - Ilya Gutkovskiy, Mar 10 2018
|
|
MAPLE
|
a:= proc(n) option remember; (t-> `if`(n=0, 0, t(n) -add(j*
binomial(n, j)*t(n-j)*a(j), j=1..n-1)/n))(i->ithprime(i))
end:
|
|
MATHEMATICA
|
a[n_] := a[n] = Function[t, If[n==0, 0, t[n] - Sum[j Binomial[n, j] t[n-j] a[j], {j, 1, n-1}]/n]][Prime];
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|