A002117 -id:A002117 - cp's OEIS frontend

A007434 Jordan function J_2(n) (a generalization of phi(n)).

1, 3, 8, 12, 24, 24, 48, 48, 72, 72, 120, 96, 168, 144, 192, 192, 288, 216, 360, 288, 384, 360, 528, 384, 600, 504, 648, 576, 840, 576, 960, 768, 960, 864, 1152, 864, 1368, 1080, 1344, 1152, 1680, 1152, 1848, 1440, 1728, 1584, 2208, 1536

Offset: 1

N. J. A. Sloane

Number of points in the bicyclic group Z/mZ X Z/mZ whose order is exactly m. - George J. Schaeffer (gschaeff(AT)andrew.cmu.edu), Mar 14 2006
Number of irreducible fractions among {(u+v*i)/n : 1 <= u, v <= n} with i = sqrt(-1), where a fraction (u+v*i)/n is called irreducible if and only if gcd(u, v, n) = 1. - Reinhard Zumkeller, Aug 20 2005
The weight of the n-th polynomial for the analog of cyclotomic polynomials for elliptic divisibility sequences. That is, let the weight of b1 = 1, b2 = 3, b3 = 8, b4 = 12 and let e1 = b1, e2 = b2*b1, e3 = b3*b1, e4 = b2*b4*b1, e5 = (b2^4*b4 - b3^3)*b1 = b5*e1, and so on, be an elliptic divisibility sequence. Then weight of e2 = 4, e3 = 9, e4 = 16, e5 = 25, where weight of en is n^2 in general, while weight of bn is a(n). - Michael Somos, Aug 12 2008
J_2(n) divides J_{2k}(n). J_2(n) gives the number of 2-tuples (x1,x2), such that 1 <= x1, x2 <= n and gcd(x1, x2, n) = 1. - Enrique Pérez Herrero, Mar 05 2011
From Jianing Song, Apr 06 2019: (Start)
Let k be any quadratic field such that all prime factors of n are inert in k, O_k be the corresponding ring of integers and G(n) = (O_k/nO_k)* be the multiplicative group of integers in O_k modulo n, then a(n) is the number of elements in G(n). The exponent of G(n) is A306933(n). [Equivalently, G(p^e) can be defined as (Z_{p^2}/p^eZ_{p^2})*, where Z_{p^2} is the ring of integers of the field Q_{p^2} (with a unique maximal ideal pZ_{p^2}), and Q_{p^2} is the unique unramified quadratic extension of the p-adic field Q_p. For the group structure of G(p^e), see A306933. - Jianing Song, Jun 19 2025]
For n >= 5, a(n) is divisible by 24. (End)
The Del Centina article on page 106 mentions a formula by Halphen denoted by phi(n)T(n). - Michael Somos, Feb 05 2021

			a(4) = 12 because the divisors of 4 being 1, 2, 4, we find that phi(1)*phi(4/1)*(4/1) = 8, phi(2)*phi(4/2)*(4/2) = 2, phi(4)*phi(4/4)*(4/4) = 2 and 8 + 2 + 2 = 12.
G.f. = x + 3*x^2 + 8*x^3 + 12*x^4 + 24*x^5 + 24*x^6 + 48*x^7 + 48*x^8 + 72*x^9 + ...

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 199, #3.
A. Del Centina, Poncelet's porism: a long story of renewed discoveries, I, Hist. Exact Sci. (2016), v. 70, p. 106.
L. E. Dickson (1919, repr. 1971). History of the Theory of Numbers I. Chelsea. p. 147.
P. J. McCarthy, Introduction to Arithmetical Functions, Universitext, Springer, New York, NY, USA, 1986.
G. Pólya and G. Szegő, Problems and Theorems in Analysis I (Springer 1924, reprinted 1972), Part Eight, Chap. 1, Section 6, Problem 64.
M. Ram Murty (2001). Problems in Analytic Number Theory. Graduate Texts in Mathematics. 206. Springer-Verlag. p. 11.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..1000
Sukumar Das Adhikari and A. Sankaranarayanan, On an error term related to the Jordan totient function Jk(n), Journal of Number Theory Volume 34, Issue 2, February 1990, Pages 178-188.
Dorin Andrica and Mihai Piticari, On Some Extensions Of Jordan's Arithmetic Functions, Proceedings of the International Conference on Theory and Applications of Mathematics and Informatics - ICTAMI 2003, Alba Iulia.
E. Artal Bartolo, P. D. González Pérez, M. González Villa, and E. León-Cardenal, On a suspension formula for Denef-Loeser zeta functions, arXiv:2502.05022 [math.AG], 2025. See p. 19.
Theo Douvropoulos, Joel Brewster Lewis, and Alejandro H. Morales, Hurwitz numbers for reflection groups III: Uniform formulas, arXiv:2308.04751 [math.CO], 2023, see p. 32.
F. A. Lewis and others, Problem 4002, Amer. Math. Monthly, Vol. 49, No. 9, Nov. 1942, pp. 618-619.
H. Li and T. MacHenry, Permanents and Determinants, Weighted Isobaric Polynomials, and Integer Sequences, J. Int. Seq. 16 (2013) #13.3.5, example 38.
MathOverflow, Averages of euler-phi function and similar.
Carl-Fredrik Nyberg-Brodda, On congruence subgroups of SL_2(Z[1/p]) generated by two parabolic elements, arXiv:2312.11258 [math.GR], 2023.
Nittiya Pabhapote and Vichian Laohakosol, Combinatorial Aspects of the Generalized Euler's Totient, International Journal of Mathematics and Mathematical Sciences, Volume 2010 (2010), Article ID 648165, 15 p.
Wolfgang Schramm, The Fourier transform of functions of the greatest common divisor, Electronic Journal of Combinatorial Number Theory A50 (8(1)), 2008.
N. J. A. Sloane, Transforms.
S. Thajoddin and S. Vangipuram, A Note On Jordan's Totient Function, Indian J. Pure Appl. Math, 1988.
László Tóth, Multiplicative arithmetic functions of several variables: a survey, arXiv preprint arXiv:1310.7053 [math.NT], 2013.
Wikipedia, Jordan's totient function.
Index to divisibility sequences

Cf. A000056, A000290, A001065, A001615, A027750, A046970, A115000, A134675.
Cf. A059379 and A059380 (triangle of values of J_k(n)).
Cf. A000010 (J_1), this sequence (J_2), A059376 (J_3), A059377 (J_4), A059378 (J_5).
Cf. A002117, A088453, A301875, A301876, A321879 (partial sums).

a007434 n = sum $ zipWith3 (\x y z -> x * y * z)
                  tdivs (reverse tdivs) (reverse divs)
                  where divs = a027750_row n;  tdivs = map a000010 divs
-- Reinhard Zumkeller, Nov 24 2012

J := proc(n,k) local i,p,t1,t2; t1 := n^k; for p from 1 to n do if isprime(p) and n mod p = 0 then t1 := t1*(1-p^(-k)); fi; od; t1; end; # (with k = 2)
A007434 := proc(n)
    add(d^2*numtheory[mobius](n/d),d=numtheory[divisors](n)) ;
end proc: # R. J. Mathar, Nov 03 2015

jordanTotient[n_, k_:1] := DivisorSum[n, #^k*MoebiusMu[n/#] &] /; (n > 0) && IntegerQ[n]; Table[jordanTotient[n, 2], {n, 48}] (* Enrique Pérez Herrero, Sep 14 2010 *)
a[ n_] := If[ n < 1, 0, Sum[ d^2 MoebiusMu[ n/d], {d, Divisors @ n}]]; (* Michael Somos, Jan 11 2014 *)
a[ n_] := If[ n < 2, Boole[ n == 1], n^2 (Times @@ ((1 - 1/#[[1]]^2) & /@ FactorInteger @ n))]; (* Michael Somos, Jan 11 2014 *)
jordanTotient[n_Integer?Positive, r_:1] := DirichletConvolve[MoebiusMu[K], K^r, K, n]; Table[jordanTotient[n, 2], {n, 48}] (* Jan Mangaldan, Jun 03 2016 *)

{a(n) = if( n<1, 0, sumdiv(n, d, d^2 * moebius(n / d)))}; /* Michael Somos, Mar 20 2004 */

{a(n) = if( n<1, 0, direuler( p=2, n, (1 - X) / (1 - X*p^2))[n])}; /* Michael Somos, Jan 11 2014 */

seq(n) = dirmul(vector(n,k,k^2), vector(n,k,moebius(k)));
seq(48)  \\ Gheorghe Coserea, May 11 2016

jordan(n,k)=my(a=n^k);fordiv(n,i,if(isprime(i),a*=(1-1/(i^k))));a  \\ Roderick MacPhee, May 05 2017

from math import prod
from sympy import factorint
def A007434(n): return prod(p**(e-1<<1)*(p**2-1) for p, e in factorint(n).items()) # Chai Wah Wu, Jan 29 2024

Moebius transform of squares.
Multiplicative with a(p^e) = p^(2e) - p^(2e-2). - Vladeta Jovovic, Jul 26 2001
a(n) = Sum_{d|n} d^2 * mu(n/d). - Benoit Cloitre, Apr 05 2002
a(n) = n^2 * Product_{p|n} (1-1/p^2). - Tom Edgar, Jan 07 2015
a(n) = Sum_{d|n} phi(d)*phi(n/d)*n/d; Sum_{d|n} a(d) = n^2. - Reinhard Zumkeller, Aug 20 2005
Dirichlet generating function: zeta(s-2)/zeta(s). - Franklin T. Adams-Watters, Sep 11 2005
Dirichlet inverse of A046970. - Michael Somos, Jan 11 2014
a(n) = a(n^2)/n^2. - Enrique Pérez Herrero, Sep 14 2010
a(n) = A000010(n) * A001615(n).
If n > 1, then 1 > a(n)/n^2 > 1/zeta(2). - Enrique Pérez Herrero, Jul 14 2011
a(n) = Sum_{d|n} phi(n^2/d)*mu(d)^2. - Enrique Pérez Herrero, Jul 24 2012
a(n) = Sum_{k = 1..n} gcd(k, n)^2 * cos(2*Pi*k/n). - Enrique Pérez Herrero, Jan 18 2013
a(1) + a(2) + ... + a(n) ~ 1/(3*zeta(3))*n^3 + O(n^2). Lambert series Sum_{n >= 1} a(n)*x^n/(1 - x^n) = x*(1 + x)/(1 - x)^3. - Peter Bala, Dec 23 2013
n * a(n) = A000056(n). - Michael Somos, Mar 20 2004
a(n) = 24 * A115000(n) unless n < 5. - Michael Somos, Aug 12 2008
a(n) = A001065(n) - A134675(n). - Conjectured by John Mason and proved by Max Alekseyev, Jan 07 2015
a(n) = Sum_{k=1..n} gcd(n, k) * phi(gcd(n, k)), where phi(k) is the Euler totient function. - Daniel Suteu, Jun 15 2018
G.f.: Sum_{k>=1} mu(k)*x^k*(1 + x^k)/(1 - x^k)^3. - Ilya Gutkovskiy, Oct 24 2018
Sum_{k>=1} 1/a(k) = Product_{primes p} (1 + p^2/(p^2 - 1)^2) = 1.81078147612156295224312590448625180897250361794500723589001447178002894356... - Vaclav Kotesovec, Sep 19 2020
Limit_{n->oo} (1/n) * Sum_{k=1..n} a(k)/k^2 = 1/zeta(3) (A088453). - Amiram Eldar, Oct 12 2020
From Richard L. Ollerton, May 09 2021: (Start)
a(n) = Sum_{k=1..n} (n/gcd(n,k))^2*mu(gcd(n,k))/phi(n/gcd(n,k)).
a(n) = Sum_{k=1..n} gcd(n,k)^2*mu(n/gcd(n,k))/phi(n/gcd(n,k)).
a(n) = Sum_{k=1..n} n*phi(gcd(n,k))/gcd(n,k).
a(n) = Sum_{k=1..n} phi(n*gcd(n,k))*mu(n/gcd(n,k))^2.
a(n) = Sum_{k=1..n} phi(n^2/gcd(n,k))*mu(gcd(n,k))^2*phi(gcd(n,k))/phi(n/gcd(n,k)). (End)
a(n) = Sum_{k = 1..n} phi(gcd(n, k)^2) = Sum_{d divides n} phi(d^2)*phi(n/d). - Peter Bala, Jan 17 2024
a(n) = Sum_{1 <= i, j <= n, lcm(i, j) = n} phi(i)*phi(j). See Tóth, p. 14. - Peter Bala, Jan 29 2024
Conjecture: a(n) = lim_{k->oo} (n^(2*(k + 1)))/A001157(n^k). - Velin Yanev, Dec 04 2024

Thanks to Michael Somos for catching an error in this sequence.

A005596 Decimal expansion of Artin's constant Product_{p=prime} (1-1/(p^2-p)).

Original entry on oeis.org

3, 7, 3, 9, 5, 5, 8, 1, 3, 6, 1, 9, 2, 0, 2, 2, 8, 8, 0, 5, 4, 7, 2, 8, 0, 5, 4, 3, 4, 6, 4, 1, 6, 4, 1, 5, 1, 1, 1, 6, 2, 9, 2, 4, 8, 6, 0, 6, 1, 5, 0, 0, 4, 2, 0, 9, 4, 7, 4, 2, 8, 0, 2, 4, 1, 7, 3, 5, 0, 1, 8, 2, 0, 4, 0, 0, 2, 8, 0, 8, 2, 3, 4, 4, 3, 0, 4, 3, 1, 7, 0, 8, 7, 2, 5, 0, 5, 6, 8, 9, 8, 1, 6, 0, 3

Offset: 0

N. J. A. Sloane

On Simon Plouffe's web page (and in the book freely available at Gutenberg project) the value is given with an error of +1e-31, as "...651641..." instead of "...641641...". In the reference [Wrench, 1961] cited there, these digits are correct. They are also correct on the Plouffe's Inverter page, as computed by Oliveira e Silva, who comments it took 1 hour at 200 MHz with Mathematica. Using Amiram Eldar's PARI program, the same 500 digits are computed instantly (less than 0.1 sec). - M. F. Hasler, Apr 20 2021

Named after the Austrian mathematician Emil Artin (1898-1962). - Amiram Eldar, Jun 20 2021

			0.37395581361920228805472805434641641511162924860615...

Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 169.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Harry J. Smith, Table of n, a(n) for n = 0..1000
Ivan Cherednik, A note on Artin's constant, arXiv:0810.2325 [math.NT], 2008.
Henri Cohen, High-precision computation of Hardy-Littlewood constants, (1998).
Henri Cohen, High-precision computation of Hardy-Littlewood constants. [pdf copy, with permission]
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 156 (constant C7).
R. J. Mathar, Hardy-Littlewood constants embedded into infinite products over all positive integers, arXiv:0903.2514 [math.NT], 2009-2001; constant A_1^(1).
Pieter Moree, Artin's primitive root conjecture - a survey, arXiv:math/0412262 [math.NT], 2004-2012.
Pieter Moree, The formal series Witt transform, Discr. Math., Vol. 295, No. 1-3 (2005), pp. 143-160. See p. 159.
G. Niklasch, Some number theoretical constants: 1000-digit values. [Cached copy]
G. Niklasch, Artin's constant.
Simon Plouffe, The Artin's Constant=product(1-1/(p**2-p), p=prime) [backup on web.archive.org; chapter 8 of the free Gutenberg.org/ebooks/634]. [Warning: the value given in this reference is incorrect, cf. comment!]
Tomás Oliveira e Silva and Plouffe's Inverter, The first 500 digits of Artin's constant.
Eric Weisstein's World of Mathematics, Artin's constant.
Eric Weisstein's World of Mathematics, Full Reptend Prime.
R. G. Wilson v, Letter to N. J. A. Sloane, Aug. 1993.
John W. Wrench, Jr., Evaluation of Artin's constant and the twin-prime constant, Math. Comp., Vol. 15, No. 76 (1961), pp. 396-398.
Index entries for sequences related to Artin's conjecture.

Cf. A048296, A065414, A001913, A001122.

a = Exp[-NSum[ (LucasL[n] - 1)/n PrimeZetaP[n], {n, 2, Infinity}, PrecisionGoal -> 500, WorkingPrecision -> 500, NSumTerms -> 100000]]; RealDigits[a, 10, 111][[1]] (* Robert G. Wilson v, Sep 03 2014 taken from Mathematica's Help file on PrimeZetaP *)

prodinf(n=2,1/zeta(n)^(sumdiv(n, d, moebius(n/d)*(fibonacci(d-1)+fibonacci(d+1)))/n)) \\ Charles R Greathouse IV, Aug 27 2014

prodeulerrat(1-1/(p^2-p)) \\ Amiram Eldar, Mar 12 2021

Equals Product_{j>=2} 1/Zeta(j)^A006206(j), where Zeta = A013661, A002117 etc. is Riemann's zeta function. - R. J. Mathar, Feb 14 2009
Equals Sum_{k>=1} mu(k)/(k*phi(k)), where mu is the Moebius function (A008683) and phi is the Euler totient function (A000010). - Amiram Eldar, Mar 11 2020
Equals 1/A065488. - Vaclav Kotesovec, Jul 17 2021

More terms from Tomás Oliveira e Silva (http://www.ieeta.pt/~tos)

A026007 Expansion of Product_{m>=1} (1 + q^m)^m; number of partitions of n into distinct parts, where n different parts of size n are available.

Original entry on oeis.org

1, 1, 2, 5, 8, 16, 28, 49, 83, 142, 235, 385, 627, 1004, 1599, 2521, 3940, 6111, 9421, 14409, 21916, 33134, 49808, 74484, 110837, 164132, 241960, 355169, 519158, 755894, 1096411, 1584519, 2281926, 3275276, 4685731, 6682699, 9501979, 13471239, 19044780, 26850921, 37756561, 52955699

Offset: 0

N. J. A. Sloane

In general, for t > 0, if g.f. = Product_{m>=1} (1 + t*q^m)^m then a(n) ~ c^(1/6) * exp(3^(2/3) * c^(1/3) * n^(2/3) / 2) / (3^(2/3) * (t+1)^(1/12) * sqrt(2*Pi) * n^(2/3)), where c = Pi^2*log(t) + log(t)^3 - 6*polylog(3, -1/t). - Vaclav Kotesovec, Jan 04 2016

			For n = 4, we have 8 partitions
  01: [4]
  02: [4']
  03: [4'']
  04: [4''']
  05: [3, 1]
  06: [3', 1]
  07: [3'', 1]
  08: [2, 2']

Alois P. Heinz, Table of n, a(n) for n = 0..10000
Lida Ahmadi, Ricardo Gómez Aíza, and Mark Daniel Ward, A unified treatment of families of partition functions, La Matematica (2024). Preprint available as arXiv:2303.02240 [math.CO], 2023.
Vaclav Kotesovec, Graph - The asymptotic ratio
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 18.

Cf. A000009, A000027, A026741, A073592, A255528, A261562, A266857, A285223, A304040.
Cf. A000219. - Gary W. Adamson, Jun 13 2009
Cf. A027998, A248882, A248883, A248884.
Cf. A026011, A027346, A027906.
Column k=1 of A284992.

with(numtheory):
b:= proc(n) option remember;
      add((-1)^(n/d+1)*d^2, d=divisors(n))
    end:
a:= proc(n) option remember;
      `if`(n=0, 1, add(b(k)*a(n-k), k=1..n)/n)
    end:
seq(a(n), n=0..45);  # Alois P. Heinz, Aug 03 2013

a[n_] := a[n] = 1/n*Sum[Sum[(-1)^(k/d+1)*d^2, {d, Divisors[k]}]*a[n-k], {k, 1, n}]; a[0] = 1; Table[a[n], {n, 0, 41}] (* Jean-François Alcover, Apr 17 2014, after Vladeta Jovovic *)
nmax=50; CoefficientList[Series[Exp[Sum[(-1)^(k+1)*x^k/(k*(1-x^k)^2),{k,1,nmax}]],{x,0,nmax}],x] (* Vaclav Kotesovec, Feb 28 2015 *)

N=66; q='q+O('q^N);
gf= prod(n=1,N, (1+q^n)^n );
Vec(gf)
/* Joerg Arndt, Oct 06 2012 */

a(n) = (1/n)*Sum_{k=1..n} A078306(k)*a(n-k). - Vladeta Jovovic, Nov 22 2002
G.f.: Product_{m>=1} (1+x^m)^m. Weighout transform of natural numbers (A000027). Euler transform of A026741. - Franklin T. Adams-Watters, Mar 16 2006
a(n) ~ zeta(3)^(1/6) * exp((3/2)^(4/3) * zeta(3)^(1/3) * n^(2/3)) / (2^(3/4) * 3^(1/3) * sqrt(Pi) * n^(2/3)), where zeta(3) = A002117. - Vaclav Kotesovec, Mar 05 2015

A085541 Decimal expansion of the prime zeta function at 3.

Original entry on oeis.org

1, 7, 4, 7, 6, 2, 6, 3, 9, 2, 9, 9, 4, 4, 3, 5, 3, 6, 4, 2, 3, 1, 1, 3, 3, 1, 4, 6, 6, 5, 7, 0, 6, 7, 0, 0, 9, 7, 5, 4, 1, 2, 1, 2, 1, 9, 2, 6, 1, 4, 9, 2, 8, 9, 8, 8, 8, 6, 7, 2, 0, 1, 6, 7, 0, 1, 6, 3, 1, 5, 8, 9, 5, 2, 8, 1, 2, 9, 5, 8, 7, 6, 3, 5, 6, 3, 4, 2, 0, 0, 5, 3, 6, 9, 7, 2, 5, 6, 0, 5, 4, 6, 7, 9, 1

Offset: 0

Cino Hilliard, Jul 02 2003

Mathar's Table 1 (cited below) lists expansions of the prime zeta function at integers s in 10..39. - Jason Kimberley, Jan 05 2017

			0.1747626392994435364231...

Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.
J. W. L. Glaisher, On the Sums of Inverse Powers of the Prime Numbers, Quart. J. Math. 25, 347-362, 1891.

Jason Kimberley, Table of n, a(n) for n = 0..1497
Henri Cohen, High Precision Computation of Hardy-Littlewood Constants, Preprint, 1998.
Henri Cohen, High-precision computation of Hardy-Littlewood constants. [pdf copy, with permission]
X. Gourdon and P. Sebah, Some Constants from Number theory
R. J. Mathar, Series of reciprocal powers of k-almost primes, arXiv:0803.0900 [math.NT], 2008-2009. Table 1.
Gerhard Niklasch and Pieter Moree, Some number-theoretical constants [Cached copy]
Eric Weisstein's World of Mathematics, Prime Zeta Function
Index to constants which are prime zeta sums {3,0,0}

Decimal expansion of the prime zeta function: A085548 (at 2), this sequence (at 3), A085964 (at 4) to A085969 (at 9).

Cf. A002117, A030078, A242302.

R := RealField(106);
PrimeZeta := func;
Reverse(IntegerToSequence(Floor(PrimeZeta(3,117)*10^105)));
// Jason Kimberley, Dec 30 2016

(* If Mathematica version >= 7.0 then RealDigits[PrimeZetaP[3]//N[#,105]&][[1]] else : *) m = 200; $MaxExtraPrecision = 200; PrimeZetaP[s_] := NSum[MoebiusMu[k]*Log[Zeta[k*s]]/k, {k, 1, m}, AccuracyGoal -> m, NSumTerms -> m, PrecisionGoal -> m, WorkingPrecision -> m]; RealDigits[PrimeZetaP[3]][[1]][[1 ;; 105]] (* Jean-François Alcover, Jun 24 2011 *)

recip3(n) = { v=0; p=1; forprime(y=2,n, v=v+1./y^3; ); print(v) }

sumeulerrat(1/p,3) \\ Hugo Pfoertner, Feb 03 2020

P(3) = Sum_{p prime} 1/p^3 = Sum_{n>=1} mobius(n)*log(zeta(3*n))/n. - Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Jul 06 2003
Equals A086033 + A085992 + 1/8. - R. J. Mathar, Jul 22 2010
Equals Sum_{k>=1} 1/A030078(k). - Amiram Eldar, Jul 27 2020

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Jul 06 2003

A002391 Decimal expansion of natural logarithm of 3.

Original entry on oeis.org

1, 0, 9, 8, 6, 1, 2, 2, 8, 8, 6, 6, 8, 1, 0, 9, 6, 9, 1, 3, 9, 5, 2, 4, 5, 2, 3, 6, 9, 2, 2, 5, 2, 5, 7, 0, 4, 6, 4, 7, 4, 9, 0, 5, 5, 7, 8, 2, 2, 7, 4, 9, 4, 5, 1, 7, 3, 4, 6, 9, 4, 3, 3, 3, 6, 3, 7, 4, 9, 4, 2, 9, 3, 2, 1, 8, 6, 0, 8, 9, 6, 6, 8, 7, 3, 6, 1, 5, 7, 5, 4, 8, 1, 3, 7, 3, 2, 0, 8, 8, 7, 8, 7, 9, 7

Offset: 1

N. J. A. Sloane

			1.098612288668109691395245236922525704647490557822749451734694333637494...

Calvin C. Clawson, Mathematical Mysteries: The Beauty and Magic of Numbers, Springer, 2013. See p. 221.
W. E. Mansell, Tables of Natural and Common Logarithms. Royal Society Mathematical Tables, Vol. 8, Cambridge Univ. Press, 1964, p. 2.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Harry J. Smith, Table of n, a(n) for n = 1..20000
D. H. Bailey, Compendium to BBP formulas. [Broken link]
Peter Bala, New series for old functions.
G. Huvent, Formules BBP en base 3. - _Jaume Oliver Lafont_, Oct 12 2009
Melissa Larson, Verifying and discovering BBP-type formulas, 2008.
Simon Plouffe, Plouffe's Inverter, The natural logarithm of 3 to 10000 digits.
Simon Plouffe, log(3), natural logarithm of 3 to 2000 places.
S. Ramanujan, Notebook entry.
Horace S. Uhler, Recalculation and extension of the modulus and of the logarithms of 2, 3, 5, 7 and 17, Proc. Nat. Acad. Sci. U. S. A. 26, (1940). 205-212.
Eric Weisstein's World of Mathematics, BBP-Type Formula.
Wikipedia, Bailey-Borwein-Plouffe formula.
Index entries for transcendental numbers

Cf. A058962, A154920, A002162, A016731 (continued fraction), A073000, A105531, A254619.

RealDigits[Log[3],10,120][[1]]  (* Harvey P. Dale, Apr 23 2011 *)

log(3) \\ Charles R Greathouse IV, Jan 24 2012

# Use some guard digits when computing.
# BBP formula P(1, 4, 2, (1, 0)).
from decimal import Decimal as dec, getcontext
def BBPlog3(n: int) -> dec:
    getcontext().prec = n
    s = dec(0); f = dec(1); g = dec(4)
    for k in range(2 * n):
        s += f / dec(2 * k + 1)
        f /= g
    return s
print(BBPlog3(200))  # Peter Luschny, Nov 03 2023

log(3) = Sum_{n>=1} (9*n-4)/((3*n-2)*(3*n-1)*3*n). [Jolley, Summation of Series, Dover (1961) eq 74]
log(3) = (1/4)*(1 + Sum_{m>=0} (1/9)^(k+1)*(27/(2*k+1) + 4/(2*k+2) + 1/(2*k+3))) (a BBP-type formula). - Alexander R. Povolotsky, Dec 01 2008
log(3) = 4/5 + (1/5)*Sum_{n>=0} (1/4)^n*(1/(2*n+1) + 1/(2*n+3)). - Alexander R. Povolotsky, Dec 18 2008
log(3) = Sum_{k>=0} (1/9)^(k+1)*(9/(2k+1) + 1/(2k+2)). - Jaume Oliver Lafont, Dec 22 2008
Sum_{i>=1} 1/(9^i*i) + Sum_{i>=0} 1/(9^i*(i+1/2)) = 2*log(3) (Huvent 2001). - Jaume Oliver Lafont, Oct 12 2009
Conjecture: log(3) = Sum_{k>=1} A191907(3,k)/k. - Mats Granvik, Jun 19 2011
log(3) = lim_{n->oo} Sum_{k=3^n..3^(n+1)-1} 1/k. Also see A002162. By analogy to the integral of 1/x, log(m) = lim_{n->oo} Sum_{k=m^n..m^(n+1)-1} 1/k, for any value of m > 1. - Richard R. Forberg, Aug 16 2014
From Peter Bala, Feb 04 2015: (Start)
log(3) = Sum {k >= 0} 1/((2*k + 1)*4^k).
Define a pair of integer sequences A(n) = 4^n*(2*n + 1)!/n! and B(n) = A(n)*Sum_{k = 0..n} 1/((2*k + 1)*4^k). Both sequences satisfy the same second-order recurrence equation u(n) = (20*n + 6)*u(n-1) - 16*(2*n - 1)^2*u(n-2). From this observation we obtain the continued fraction expansion log(3) = 1 + 2/(24 - 16*3^2/(46 - 16*5^2/(66 - ... - 16*(2*n - 1)^2/((20*n + 6) - ... )))). Cf. A002162, A073000 and A105531 for similar expansions.
log(3) = 2 * Sum_{k >= 1} (-1)^(k+1)*(4/3)^k/(k*binomial(2*k,k)).
log(3) = (1/4) * Sum_{k >= 1} (-1)^(k+1) (55*k - 23)*(8/9)^k/( 2*k*(2*k - 1)*binomial(3*k,k) ).
log(3) = (1/4) * Sum_{k >= 1} (7*k + 1)*(8/3)^k/( 2*k*(2*k - 1)*binomial(3*k,k) ). (End)
log(3) = -lim_{n->oo} (n+1)th derivative of zeta(n) / n-th derivative of zeta(n). By n = 1000 there is convergence to 25 digits. A related expression: lim_{n->oo} n-th derivative of zeta(n-1) / n-th derivative of zeta(n) = 3. Also see A002581. - Richard R. Forberg, Feb 24 2015
From Peter Bala, Nov 02 2019: (Start)
log(3) = 2*Integral_{x = 0..1} (1 - x^2)/(1 + x^2 + x^4) dx = 2*( 1 - (2/3) + 1/5 + 1/7 - (2/9) + 1/11 + 1/13 - (2/15) + ... ).
log(3) = 16*Sum_{n >= 0} 1/( (6*n + 1)*(6*n + 3)*(6*n + 5) ).
log(3) = 4/5 + 64*Sum_{n >= 0} (18*n + 1)/((6*n - 5)*(6*n - 3)*(6*n - 1)*(6*n + 1)*(6*n + 7)). (End)
From Amiram Eldar, Jul 05 2020: (Start)
Equals 2*arctanh(1/2).
Equals Sum_{k>=1} (2/3)^k/k.
Equals Integral_{x=0..Pi} sin(x)dx/(2 + cos(x)). (End)
log(3) = Integral_{x = 0..1} (x^2 - 1)/log(x) dx. - Peter Bala, Nov 14 2020
From Peter Bala, Oct 28 2023: (Start)
The series representation log(3) = 16*Sum_{n >= 0} 1/((6*n + 1)*(6*n + 3)*(6*n + 5)) given above appears to be the case k = 0 of the following infinite family of series representations for log(3):
log(3) = c(k) + (-1)^k*d(k)*Sum_{n >= 0} 1/((6*n + 1)*(6*n + 3)*...*(6*n + 12*k + 5)), where c(k) is a rational approximation to log(3) and d(k) = 2^(6*k+3)/27^k * (6*k + 2)!.
The first few values of c(k) for k >= 0 are [0, 2996/2673, 89195548/81236115, 23239436137364/21153065697225, 3345533089100222564/3045237239236561677, ...]. Cf A304656. (End)
log(3) = 1 + 2*Sum_{k>=1} 1/((3*k)^3 - 3*k) [Ramanujan]. - Stefano Spezia, Jul 01 2024

Editing and more terms from Charles R Greathouse IV, Apr 20 2010

A013665 Decimal expansion of zeta(7).

Original entry on oeis.org

1, 0, 0, 8, 3, 4, 9, 2, 7, 7, 3, 8, 1, 9, 2, 2, 8, 2, 6, 8, 3, 9, 7, 9, 7, 5, 4, 9, 8, 4, 9, 7, 9, 6, 7, 5, 9, 5, 9, 9, 8, 6, 3, 5, 6, 0, 5, 6, 5, 2, 3, 8, 7, 0, 6, 4, 1, 7, 2, 8, 3, 1, 3, 6, 5, 7, 1, 6, 0, 1, 4, 7, 8, 3, 1, 7, 3, 5, 5, 7, 3, 5, 3, 4, 6, 0, 9, 6, 9, 6, 8, 9, 1, 3, 8, 5, 1, 3, 2

Offset: 1

N. J. A. Sloane

From Dimitris Valianatos, Apr 29 2020: (Start)
Let p_n = Product_{k >= 1, 4*k-1 is prime} (((4*k - 1)^n + 1) / ((4*k - 1)^n - 1)).
Then (2^(n + 1) / (2^n - 1)) * Sum_{k >= 1} 1 / (4*k - 3)^n = ((p_n + 1) / p_n) * Sum_{k >= 1} 1 / k^n = ((p_n + 1) / p_n) * zeta(n), n >= 3 odd number.
For n = 7, p_7 = 1.00091744947834007403796003463414...
The product (256 / 127) * Sum_{k >= 1} 1 / (4*k - 3)^7 = 2.01577429320860871987548541116538... is equal to the product ((p_7 + 1) / p_7) * Sum_{k >= 1} 1 / k^7 = 1.9990833914636834116748... * zeta(7) = 2.01577429320860871987548541116538... (End)

			1.0083492773819228268397975498497967595998635605652387064172831365716014...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 811.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 262.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 1.6.3, p. 43.

Jakob Ablinger, Proving two conjectural series for zeta(7) and discovering more series for zeta(7), arXiv:1908.06631 [math.CO], 2019.
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
J. Borwein and D. Bradley, Empirically determined Apéry-like formulas for zeta(4n+3), arXiv:math/0505124 [math.CA], 2005.
Michael J. Dancs and Tian-Xiao He, An Euler-type formula for zeta(2k+1), Journal of Number Theory, Volume 118, Issue 2, June 2006, Pages 192-199.
Simon Plouffe, Plouffe's Inverter, Zeta(7) to 50000 digits.
Simon Plouffe, Zeta(7) to 512 places:sum(1/n^7, n=1..infinity).

Cf. A013661, A002117, A013662, A013663, A013664, A013666, A013667, A013668, A013669, A013670, A013671, A013672, A013673, A013674, A013675, A013676, A013677, A013678, A293904.

Cf. A023874, A023875, A248884.

RealDigits[Zeta[7],10,120][[1]] (* Harvey P. Dale, Oct 23 2012 *)

PARI
```
zeta(7) \\ Michel Marcus, Apr 17 2016
```

zeta(7) = Sum_{n >= 1} (A010052(n)/n^(7/2)) = Sum_{n >= 1} ( (floor(sqrt(n))-floor(sqrt(n-1)))/n^(7/2) ). - Mikael Aaltonen, Feb 22 2015
zeta(7) = Product_{k>=1} 1/(1 - 1/prime(k)^7). - Vaclav Kotesovec, Apr 30 2020
From Artur Jasinski, Jun 27 2020: (Start)
zeta(7) = (-1/840)*Integral_{x=0..1} log(1-x^6)^7/x^7.
zeta(7) = (1/720)*Integral_{x=0..oo} x^6/(exp(x)-1).
zeta(7) = (4/2835)*Integral_{x=0..oo} x^6/(exp(x)+1).
zeta(7) = (1/(182880*Zeta(1/2)^7))*(-61*Pi^7*zeta(1/2)^7 + 2880* zeta'(1/2)^7 - 10080*zeta(1/2)*zeta'(1/2)^5*zeta''(1/2) + 10080* zeta(1/2)^2*zeta'(1/2)^3*zeta''(1/2)^2 - 2520*zeta(1/2)^3*zeta'(1/2)* zeta''(1/2)^3 + 3360*zeta(1/2)^2*zeta'(1/2)^4*zeta'''(1/2) - 5040 zeta(1/2)^3*zeta'(1/2)^2*zeta''(1/2)*zeta'''(1/2) + 840*zeta(1/2)^4* zeta''(1/2)^2*zeta'''(1/2) + 560*zeta(1/2)^4*zeta'(1/2)*zeta'''(1/2)^3  - 840*zeta(1/2)^3*zeta'(1/2)^3*zeta''''(1/2) + 840*zeta(1/2)^4*zeta'(1/2)* zeta''(1/2)*zeta''''(1/2) - 140*zeta(1/2)^5*zeta'''(1/2)*zeta''''(1/2) + 168*zeta(1/2)^4*zeta'(1/2)^2*zeta'''''(1/2) - 84*zeta(1/2)^5*zeta''(1/2)* zeta'''''(1/2) - 28*zeta(1/2)^5*zeta'(1/2)*zeta''''''(1/2) + 4* zeta(1/2)^6*zeta'''''''(1/2)). (End)
Equals 19*Pi^7/56700 - 2*Sum_{k>=1} 1/(k^7*(exp(2*Pi*k) - 1)) [Grosswald] (see Finch). - Stefano Spezia, Nov 01 2024
From Peter Bala, Apr 27 2025: (Start)
zeta(7) = 1/7! * Integral_{x >= 0} x^7 * exp(x)/(exp(x) - 1)^2 dx = 2^6/(2^6 - 1) * 1/7! * Integral_{x >= 0} x^7 * exp(x)/(exp(x) + 1)^2 dx.
zeta(7) = 1/8! * Integral_{x >= 0} x^8 * exp(x)*(exp(x) + 1) /(exp(x) - 1)^3 dx = 1/ (2*3*7*15*63) * Integral_{x >= 0} x^8 * exp(x)*(exp(x) - 1)/(exp(x) + 1)^3 dx. (End)

A013667 Decimal expansion of zeta(9).

Original entry on oeis.org

1, 0, 0, 2, 0, 0, 8, 3, 9, 2, 8, 2, 6, 0, 8, 2, 2, 1, 4, 4, 1, 7, 8, 5, 2, 7, 6, 9, 2, 3, 2, 4, 1, 2, 0, 6, 0, 4, 8, 5, 6, 0, 5, 8, 5, 1, 3, 9, 4, 8, 8, 8, 7, 5, 6, 5, 4, 8, 5, 9, 6, 6, 1, 5, 9, 0, 9, 7, 8, 5, 0, 5, 3, 3, 9, 0, 2, 5, 8, 3, 9, 8, 9, 5, 0, 3, 9, 3, 0, 6, 9, 1, 2, 7, 1, 6, 9, 5, 8

Offset: 1

N. J. A. Sloane

			1.0020083928260822...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 811.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Simon Plouffe, Plouffe's Inverter, Zeta(9)=sum(1/n^9, n=1..infinity); to 20000 digits
Simon Plouffe, Zeta(9) or sum(1/n**9, n=1..infinity);

Cf. A013661, A002117, A013662, A013663, A013664, A013665, A013666, A013668, A013669, A013670, A013671, A013672, A013673, A013674, A013675, A013676, A013677, A013678, A293904.

Cf. A023876, A023877.

evalf(Zeta(9)) ; # R. J. Mathar, Oct 16 2015

RealDigits[Zeta[9],10,100][[1]] (* Harvey P. Dale, Aug 27 2014 *)

From Peter Bala, Dec 04 2013: (Start)
Definition: zeta(9) = Sum_{n >= 1} 1/n^9.
zeta(9) = 2^9/(2^9 - 1)*( Sum_{n even} n^7*p(n)*p(1/n)/(n^2 - 1)^10 ), where p(n) = n^4 + 10*n^2 + 5. See A013663, A013671 and A013675. (End)
zeta(9) = Sum_{n >= 1} (A010052(n)/n^(9/2)) = Sum_{n >= 1} ( (floor(sqrt(n))-floor(sqrt(n-1)))/n^(9/2) ). - Mikael Aaltonen, Feb 22 2015
zeta(9) = Product_{k>=1} 1/(1 - 1/prime(k)^9). - Vaclav Kotesovec, May 02 2020
From  Peter Bala, Apr 27 2025: (Start)
zeta(9) = 1/9! * Integral_{x >= 0} x^9 * exp(x)/(exp(x) - 1)^2 dx = 2^9/(2^9 - 1) * 1/9! * Integral_{x >= 0} x^9 * exp(x)/(exp(x) + 1)^2 dx.
zeta(9) = 1/10! * Integral_{x >= 0} x^10 * exp(x)*(exp(x) + 1)/(exp(x) - 1)^3 dx = 1/(3^5 * 5^3 * 7 * 17) * Integral_{x >= 0} x^10 * exp(x)*(exp(x) - 1)/(exp(x) + 1)^3 dx. (End)

A048146 Sum of non-unitary divisors of n.

Original entry on oeis.org

0, 0, 0, 2, 0, 0, 0, 6, 3, 0, 0, 8, 0, 0, 0, 14, 0, 9, 0, 12, 0, 0, 0, 24, 5, 0, 12, 16, 0, 0, 0, 30, 0, 0, 0, 41, 0, 0, 0, 36, 0, 0, 0, 24, 18, 0, 0, 56, 7, 15, 0, 28, 0, 36, 0, 48, 0, 0, 0, 48, 0, 0, 24, 62, 0, 0, 0, 36, 0, 0, 0, 105, 0, 0, 20, 40, 0, 0, 0, 84, 39, 0, 0, 64, 0, 0, 0, 72, 0, 54, 0

Offset: 1

Labos Elemer

nonn

			If n = 1000, the 12 non-unitary divisors are {2, 4, 5, 10, 20, 25, 40, 50, 100, 200, 250, 500} and their sum is a(n) = a(1000) = 1206. a(16) = a(2^4) = (2^4 - 2) / (2 - 1)= 14.

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A034444, A000203, A006881, A048105, A048106, A048107, A048109, A048111, A005117, A120944.

Cf. A002117, A072691.

us[n_Integer] := (d = Divisors[n]; l = Length[d]; k = 1; s = n; While[k < l, If[ GCD[ d[[k]], n/d[[k]] ] == 1, s = s + d[[k]]]; k++ ]; s); Table[ DivisorSigma[1, n] - us[n], {n, 1, 100} ]
(* Second program: *)
Table[DivisorSum[n, # &, ! CoprimeQ[#, n/#] &], {n, 91}] (* Michael De Vlieger, Nov 20 2017 *)

a(n)=my(f=factor(n)); sigma(f)-prod(i=1, #f~, f[i, 1]^f[i, 2]+1) \\ Charles R Greathouse IV, Jun 17 2015

from sympy.ntheory.factor_ import divisor_sigma, udivisor_sigma
def A048146(n): return divisor_sigma(n)-udivisor_sigma(n) # Chai Wah Wu, Aug 22 2024

a(n) = A000203(n) - A034448(n) = sigma(n) - usigma(n). a(1) = 0, a(p) = 0, a(pq) = 0, a(pq...z) = 0, a(p^k) = (p^k - p) / (p - 1), for p = primes (A000040), pq = product of two distinct primes (A006881), pq...z = product of k (k >=2) distinct primes p, q, ..., z (A120944), p^k = prime powers (A000961(n) for n > 1) k = natural numbers (A000027).

Sum_{k=1..n} a(k) ~ c * n^2, where c = (Pi^2/12) * (1 - 1/zeta(3)) = 0.1382506... . - Amiram Eldar, Dec 09 2022

Edited by Jaroslav Krizek, Mar 01 2009

A082695 Decimal expansion of zeta(2)*zeta(3)/zeta(6).

Original entry on oeis.org

1, 9, 4, 3, 5, 9, 6, 4, 3, 6, 8, 2, 0, 7, 5, 9, 2, 0, 5, 0, 5, 7, 0, 7, 0, 3, 6, 2, 5, 7, 4, 7, 6, 3, 4, 3, 7, 1, 8, 7, 8, 5, 8, 5, 0, 1, 7, 6, 7, 8, 0, 5, 7, 1, 6, 0, 2, 6, 6, 3, 5, 6, 8, 8, 9, 0, 0, 5, 3, 4, 9, 5, 0, 6, 9, 3, 5, 5, 4, 0, 5, 3, 9, 4, 8, 1, 7, 9, 1, 0, 0, 8, 2, 1, 1, 1, 1, 3, 0, 1, 0, 6, 9, 0, 5

Offset: 1

Benoit Cloitre, Apr 12 2003

Equals the Dirichlet zeta-function Sum_{n>=1} A001615(n)/n^s at s=3. - R. J. Mathar, Apr 02 2011
Dressler shows that this is the average value of A014197, that is, the number of values m such that phi(m) <= n is asymptotically n times this constant. Erdős had shown earlier that this limit exists. - Charles R Greathouse IV, Nov 26 2013
From Stanislav Sykora, Nov 14 2014: (Start)
Equals lim_{n->infinity} (Sum_{k=1..n} k/phi(k))/n, i.e., the limit mean value of k/phi(k), where phi(k) is Euler's totient function.
Also equals lim_{n->infinity} (Sum_{k=1..n} 1/phi(k))/log(n).
Proofs are trivial using the formulas for Sum_{k=1..n} k/phi(k) and Sum_{k=1..n} 1/phi(k) listed in the Wikipedia link.
For the limit mean value of phi(k)/k, see A059956. (End)
The asymptotic mean of A005361. - Amiram Eldar, Apr 13 2020

			1.94359643682075920505707036257476343718785850176780571602663568890 ...

Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 2.7, p. 116.
Joe Roberts, Lure of the Integers, Mathematical Association of America, 1992. See p. 74.

Stanislav Sykora, Table of n, a(n) for n = 1..2000
Paul T. Bateman, The distribution of values of the Euler function, Acta Arithmetica 21:1 (1972), pp. 329-345.
Olivier Bordellès and Benoit Cloitre, An Alternating Sum Involving the Reciprocal of Certain Multiplicative Functions, J. Int. Seq. 16 (2013) #13.6.3.
Robert E. Dressler, A density which counts multiplicity, Pacific J. Math. 34 (1970), pp. 371-378.
Paul Erdős, Some remarks on Euler's ϕ function and some related problems, Bull. Amer. Math. Soc. 51 (1945), pp. 540-544.
J. von zur Gathen et al., Average order in cyclic groups, J. Theor. Nombres Bordeaux, 16 (2004), 107-123. Lists several other papers where this constant arises.
S. W. Golomb, Powerful numbers, Amer. Math. Monthly, Vol. 77 (1970), 848-852.
D. Handelman, Invariants for critical dimension groups and permutation-Hermite equivalence, arXiv preprint arXiv:1309.7417 [math.AC], 2013.
Eric Weisstein's World of Mathematics, Totient Summatory Function.
Eric Weisstein's World of Mathematics, Powerful Number.
Wikipedia, Euler's totient function.

Cf. A000010, A001615, A001694, A002117, A005117, A005361, A013661, A013664, A014197, A059956, A068468, A070243, A082696 (continued fraction), A157292.

First@RealDigits[ Zeta[2]*Zeta[3]/Zeta[6], 10, 100]
RealDigits[ 315 Zeta[3]/(2 Pi^4), 10, 111][[1]] (* Robert G. Wilson v, Aug 11 2014 *)

PARI
```
zeta(3)*315/2/Pi^4
```

Decimal expansion of Product_{p prime} (1+1/p/(p-1)) = zeta(2)*zeta(3)/zeta(6) = 1.94359643682075920505707...
The sum of the reciprocals of the powerful numbers, A001694. - T. D. Noe, May 03 2006
Equals A013661 * A002117 / A013664 = 1 / A068468 = zeta(3) * 315/(2*Pi^4) = zeta(3) * A157292.
Equals Sum_{k>=1} mu(k)^2/(k*phi(k)) (the sum of reciprocals of the squarefree numbers multiplied by their Euler totient function values, A000010). - Amiram Eldar, Aug 18 2020

New definition from Eric W. Weisstein, May 04 2006

A013666 Decimal expansion of zeta(8).

Original entry on oeis.org

1, 0, 0, 4, 0, 7, 7, 3, 5, 6, 1, 9, 7, 9, 4, 4, 3, 3, 9, 3, 7, 8, 6, 8, 5, 2, 3, 8, 5, 0, 8, 6, 5, 2, 4, 6, 5, 2, 5, 8, 9, 6, 0, 7, 9, 0, 6, 4, 9, 8, 5, 0, 0, 2, 0, 3, 2, 9, 1, 1, 0, 2, 0, 2, 6, 5, 2, 5, 8, 2, 9, 5, 2, 5, 7, 4, 7, 4, 8, 8, 1, 4, 3, 9, 5, 2, 8, 7, 2, 3, 0, 3, 7, 2, 3, 7, 1, 9, 7

Offset: 1

N. J. A. Sloane

This sequence is also the decimal expansion of Pi^8/9450. - Mohammad K. Azarian, Mar 03 2008

			1.00407735619794433937868523850865246525896079064985002032911020265...

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 811.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

Cf. A013661, A002117, A013662, A013663, A013664, A013665, A013667, A013668, A013669, A013670, A013671, A013672, A013673, A013674, A013675, A013676, A013677, A013678, A293904.

Digits := 100 : evalf(Pi^8/9450) ; # R. J. Mathar, Jan 07 2021

RealDigits[Zeta[8], 10, 100][[1]] (* Vincenzo Librandi, Feb 15 2015 *)

zeta(8) = 2/3*2^8/(2^8 - 1)*( Sum_{n even} n^2*p(n)/(n^2 - 1)^9 ), where p(n) = 5*n^8 + 60*n^6 + 126*n^4 + 60*n^2 + 5 is a row polynomial of A091043. See A013662, A013664, A013668 and A013670. - Peter Bala, Dec 05 2013
zeta(8) = Sum_{n >= 1} (A010052(n)/n^4). - Mikael Aaltonen, Feb 20 2015
zeta(8) = Product_{k>=1} 1/(1 - 1/prime(k)^8). - Vaclav Kotesovec, May 02 2020
From Wolfdieter Lang, Sep 16 2020 (Start):
zeta(8) = (1/7!)*Integral_{0..infinity} x^7/(exp(x) - 1) dx. See Abramowitz-Stegun, 23.2.7., for s=8, p. 807. The value of the integral is 8*Pi^8/15 = 5060.54987... .
zeta(8) = (2^7/(127*7!))*Integral_{0..infinity} x^7/(exp(x) + 1) dx. See Abramowitz-Stegun, 23.2.8., for s=8, p. 807. The prefactor is 8/40005. The value of the integral is (127/240)*Pi^8 =  5021.014329... .(End)
Equals A092736/9450. - R. J. Mathar, Jan 07 2021
From  Peter Bala, Apr 27 2025: (Start)
zeta(8) = 1/8! * Integral_{x >= 0} x^8 * exp(x)/(exp(x) - 1)^2 dx = 2^7/(2^7 - 1) * 1/8! * Integral_{x >= 0} x^8 * exp(x)/(exp(x) + 1)^2 dx.
zeta(8) = 1/9! * Integral_{x >= 0} x^9 * exp(x)*(exp(x) + 1) /(exp(x) - 1)^3 dx = 1/(3*15*63*127) * Integral_{x >= 0} x^9 * exp(x)*(exp(x) - 1)/(exp(x) + 1)^3 dx. (End)

cp's OEIS Frontend

A007434 Jordan function J_2(n) (a generalization of phi(n)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

PARI

Python

Formula

Extensions

A005596 Decimal expansion of Artin's constant Product_{p=prime} (1-1/(p^2-p)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A026007 Expansion of Product_{m>=1} (1 + q^m)^m; number of partitions of n into distinct parts, where n different parts of size n are available.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A085541 Decimal expansion of the prime zeta function at 3.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

Extensions

A002391 Decimal expansion of natural logarithm of 3.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A013665 Decimal expansion of zeta(7).