A013661 -id:A013661 - cp's OEIS frontend

A002390 Decimal expansion of natural logarithm of golden ratio.

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

Offset: 0

N. J. A. Sloane

The Baxa article proves that every gamma >= this constant is the Lévy constant of a transcendental number. - Michel Marcus, Apr 09 2016
The entropy of the golden mean shift. See Capobianco link. - Michel Marcus, Jan 19 2019
Also the limiting value of the area of the function y = 1/x bounded by the abscissa of consecutive F(n) points (where F(n)=A000045(n) are the Fibonacci numbers and n > 0). - Burak Muslu, May 09 2021

			0.481211825059603447497758913424368423135184334385660519661...

George Boros and Victor H. Moll, Irresistible integrals, Cambridge University Press (2006), p. 236.
W. E. Mansell, Tables of Natural and Common Logarithms. Royal Society Mathematical Tables, Vol. 8, Cambridge Univ. Press, 1964, p. XVIII.
B. Muslu, Sayılar ve Bağlantılar 2, Luna, 2021, pages 31-38.
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).

G. C. Greubel, Table of n, a(n) for n = 0..5000
Alexander Adamchuk's comment, Sep 01 2006 Mathematics in Russian
Christoph Baxa, Lévy constants of transcendental numbers, Proc. Amer. Math. Soc. 137 (2009), 2243-2249.
Christopher Brown, The natural logarithm of the golden section, Fibonacci Quarterly 55:5 (2017), pp. 42-44.
Silvio Capobianco, Introduction to Symbolic Dynamics. Part 4: Entropy; The entropy of the golden mean shift, Institute of Cybernetics at TUT; May 12 2010. Slides 15-17.
Simon Plouffe, Plouffe's Inverter, ln(phi) to 10000 digits
Simon Plouffe, ln(0.5+0.5*SQRT(5)) to 2000 digits
Eric Weisstein's World of Mathematics, Fibonacci Hyperbolic Functions
Index entries for transcendental numbers

Cf. A000108, A001622, A013661, A086463, A086466, A263401.

Maple
```
arcsinh(1/2); evalf(%, 120);
```

RealDigits[N[Log[GoldenRatio],200]][[1]] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2011 *)

asinh(1/2) \\ Charles R Greathouse IV, Jan 04 2016

Also equals arcsinh(1/2).
Equals sqrt(5)* A086466 /2. - Seiichi Kirikami, Aug 20 2011
Equals sqrt(5)*(5* A086465 -1)/4. - Jean-François Alcover, Apr 29 2013
Also equals (125*C - 55) / (24*sqrt(5)), where C = Sum_{k>=1} (-1)^(k+1)*1/Cat(k), where Cat(k) = (2k)!/k!/(k+1)! = A000108(k) - k-th Catalan number. See Sep 01 2006 comment at ref. Mathematics in Russian. - Alexander Adamchuk, Dec 27 2013
Equals sqrt(5)/4 * Sum_{n>=0} (-1)^n/((2n+1)*C(2*n,n)) = sqrt(5) *A344041 /4. - Alexander Adamchuk, Dec 27 2013
Equals sqrt((Pi^2/6 - W)/3), where W = Sum_{n>=0} (-1)^n/((2n+1)^2*C(2*n,n)) = A145436, attributed by Alexander Adamchuk to Ramanujan. See Sep 01 2006 comment at ref. Mathematics in Russian. - Alexander Adamchuk, Dec 27 2013
Equals lim_{j->infinity} Sum_{k=F(j)..F(j+1)-1} (1/k), where F = A000045, the Fibonacci sequence. Convergence is slow. For example: Sum_{k=21..33} (1/k) = 0.4910585.... - Richard R. Forberg, Aug 15 2014
Equals Sum_{k>=1} cos(Pi*k/5)/k. - Amiram Eldar, Aug 12 2020
Equals real solution to exp(x)+exp(2*x) = exp(3*x). - Alois P. Heinz, Jul 14 2022
Equals arccoth(sqrt(5)). - Amiram Eldar, Feb 09 2024
Sum_{n >= 1} 1/(n*P(n, sqrt(5))*P(n-1, sqrt(5))), where P(n, x) denotes the n-th Legendre polynomial. The first ten terms of the series gives the approximation log((1 + sqrt(5))/2) = 0.481211825059(39..), correct to 12 decimal places. - Peter Bala, Mar 16 2024
Equals Sum_{n>=0} ((-1)^(n)*binomial(2*n, n))/(2^(4*n + 1)*(2*n + 1)). - Antonio Graciá Llorente, Nov 13 2024

A060681 Largest difference between consecutive divisors of n (ordered by size).

Original entry on oeis.org

0, 1, 2, 2, 4, 3, 6, 4, 6, 5, 10, 6, 12, 7, 10, 8, 16, 9, 18, 10, 14, 11, 22, 12, 20, 13, 18, 14, 28, 15, 30, 16, 22, 17, 28, 18, 36, 19, 26, 20, 40, 21, 42, 22, 30, 23, 46, 24, 42, 25, 34, 26, 52, 27, 44, 28, 38, 29, 58, 30, 60, 31, 42, 32, 52, 33, 66, 34, 46, 35, 70, 36, 72, 37

Offset: 1

Labos Elemer, Apr 19 2001

Is a(n) the least m > 0 such that n - m divides n! + m? - Clark Kimberling, Jul 28 2012
Is a(n) the least m > 0 such that L(n-m) divides L(n+m), where L = A000032 (Lucas numbers)? - Clark Kimberling, Jul 30 2012
Records give A006093. - Omar E. Pol, Oct 26 2013
Divide n by its smallest prime factor p, then multiply with (p-1), with a(1) = 0 by convention. Compare also to A366387. - Antti Karttunen, Oct 23 2023
a(n) is also the smallest LCM of positive integers x and y where x + y = n. - Felix Huber, Aug 28 2024

			For n = 35, divisors are {1, 5, 7, 35}; differences are {4, 2, 28}; a(35) = largest difference = 28 = 35 - 35/5.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Antal Balog, Paul Erdős, and Gérald Tenenbaum,, On Arithmetic Functions Involving Consecutive Divisors, In: Analytical Number Theory, pp. 77-90, Birkhäuser, Basel, 1990.

Cf. A013661, A020639, A060680, A060682, A060683, A060685, A064097 (number of iterations needed to reach 1).

Cf. also A171462, A366387.

a060681 n = div n p * (p - 1) where p = a020639 n
-- Reinhard Zumkeller, Apr 06 2015

read("transforms") :
A060681 := proc(n)
    if n = 1 then
        0 ;
    else
        sort(convert(numtheory[divisors](n),list)) ;
        DIFF(%) ;
        max(op(%)) ;
    end if;
end proc:
seq(A060681(n),n=1..60) ; # R. J. Mathar, May 23 2018
# second Maple program:
A060681:=n->if(n=1,0,min(map(x->ilcm(x,n-x),[$1..1/2*n]))); seq(A060681(n),n=1..74); # Felix Huber, Aug 28 2024

a[n_ ] := n - n/FactorInteger[n][[1, 1]]
Array[Max[Differences[Divisors[#]]] &, 80, 2] (* Harvey P. Dale, Oct 26 2013 *)

diff(v)=vector(#v-1,i,v[i+1]-v[i])
a(n)=vecmax(diff(divisors(n))) \\ Charles R Greathouse IV, Sep 02 2015

a(n) = if (n==1, 0, n - n/factor(n)[1,1]); \\ Michel Marcus, Oct 24 2015

first(n) = n = max(n, 1); my(res = vector(n)); res[1] = 0; forprime(p = 2, n, for(i = 1, n \ p, if(res[p * i] == 0, res[p * i] = i*(p-1)))); res \\ David A. Corneth, Jan 08 2019

from sympy import primefactors
def A060681(n): return n-n//min(primefactors(n),default=1) # Chai Wah Wu, Jun 21 2023

a(n) = n - n/A020639(n).
a(n) = n - A032742(n). - Omar E. Pol, Aug 31 2011
a(2n) = n, a(3*(2n+1)) = 2*(2n+1) = 4n + 2. - Antti Karttunen, Oct 23 2023
Sum_{k=1..n} a(k) ~ (1/2 - c) * n^2, where c is defined in the corresponding formula in A032742. - Amiram Eldar, Dec 21 2024

Edited by Dean Hickerson, Jan 22 2002

a(1)=0 added by N. J. A. Sloane, Oct 01 2015 at the suggestion of Antti Karttunen

A007427 Moebius transform applied twice to sequence 1,0,0,0,....

Original entry on oeis.org

1, -2, -2, 1, -2, 4, -2, 0, 1, 4, -2, -2, -2, 4, 4, 0, -2, -2, -2, -2, 4, 4, -2, 0, 1, 4, 0, -2, -2, -8, -2, 0, 4, 4, 4, 1, -2, 4, 4, 0, -2, -8, -2, -2, -2, 4, -2, 0, 1, -2, 4, -2, -2, 0, 4, 0, 4, 4, -2, 4, -2, 4, -2, 0, 4, -8, -2, -2, 4, -8, -2, 0, -2, 4, -2, -2, 4, -8, -2, 0, 0

Offset: 1

N. J. A. Sloane

|a(n)| is the number of ways to write n as a product of 2 squarefree numbers (i.e., number of ways to write n = x*y with 1 <= x <= n, 1 <= y <= n, x and y squarefree). - Benoit Cloitre, Jan 01 2003

			G.f. = x - 2*x^2 - 2*x^3 + x^4 - 2*x^5 + 4*x^6 - 2*x^7 + x^9 + 4*x^10 + ...
We have a(3^1) = C(2, 1)*(-1)^1 = -2, a(3^2) = C(2, 2)*(-1)^2 = 1, and a(3^m) = C(2, m)*(-1)^m = 0 for m >= 3. - _Petros Hadjicostas_, Jun 07 2019

Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 30.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)
Yu Hin (Gary) Au, Decompositions of Unit Hypercubes and the Reversion of a Generalized Möbius Series, arXiv:2205.03680 [math.CO], 2022.
Enrique Pérez Herrero, Mathematica Package for Piltz Divisor Functions.
Enrique Pérez Herrero, Mathematica Package for Piltz Divisor Functions.
Adolf Piltz, Ueber das Gesetz, nach welchem die mittlere Darstellbarkeit der natürlichen Zahlen als Produkte einer gegebenen Anzahl Faktoren mit der Grösse der Zahlen wächst, Doctoral Dissertation, Friedrich-Wilhelms-Universität zu Berlin, 1881; the k-th Piltz function tau_k(n) is denoted by phi(n,k) and its recurrence and Dirichlet series appear on p. 6.
N. J. A. Sloane, Transforms.
Wikipedia, Adolf Piltz.

Dirichlet inverse of A000005, Mobius transform of A008683.
Cf. A063524, A007428, A005117, A008836, A046099, A225817.
Cf. A013661, A001620, A306016.

a007427 n = sum $ zipWith (*) mds $ reverse mds where
   mds = a225817_row n
-- Reinhard Zumkeller, Jul 30 2013

möbius := proc(a)  local b, i, mo: b := NULL:
mo := (m,n) -> `if`(irem(m,n) = 0, numtheory:-mobius(m/n), 0);
for i to nops(a) do b := b, add(mo(i,j)*a[j], j=1..i) od: [b] end:
(möbius@@2)([1, seq(0, i=1..80)]); # Peter Luschny, Sep 08 2017

f[n_] := Plus @@ Times @@@ (MoebiusMu[{#, n/#}] & /@ Divisors@n); Array[f, 105] (* Robert G. Wilson v *)
a[n_] := DivisorSum[n, MoebiusMu[#]*MoebiusMu[n/#]&]; Array[a, 80] (* Jean-François Alcover, Dec 01 2015 *)

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

{a(n) = if(n<1, 0, sumdiv(n, d, moebius(d) * moebius(n/d)))}; /* Michael Somos, Nov 15 2002 */

a(n)=if(n>1,my(f=factor(n)[,2],s=sum(i=1,#f,f[i]==1));if(vecmax(f)>2,0,(-1)^s<Charles R Greathouse IV, Jun 28 2011

from math import prod, comb
from sympy import factorint
def A007427(n): return prod(-comb(2,e) if e&1 else comb(2,e) for e in factorint(n).values()) # Chai Wah Wu, Jul 05 2024

Dirichlet g.f.: 1/zeta(s)^2.
Multiplicative function with a(p^e) = binomial(2, e)*(-1)^e for p prime and e >= 0.
a(n) = Sum_{d|n} mu(d)*mu(n/d). - Benoit Cloitre, Apr 05 2002
a(n^2) = A008683(n)^2. a(A005117(n)) = (-2)^A001221(A005117(n)). - Enrique Pérez Herrero, Jun 27 2011 [Misrendering of contribution rectified by Peter Munn, Mar 06 2020]
a(n) is the Dirichlet inverse of A000005, which means a(n) = -Sum_{d|n, dA000005(n/d)*a(d). - Enrique Pérez Herrero, Jan 19 2013
a(n) = 0 if n is not cubefree: A046099, otherwise sign(a(n)) = lambda(n), where lambda is A008836. - Enrique Pérez Herrero, Jan 19 2013
Dirichlet g.f. of |a(n)|: zeta(s)^2/zeta(2s)^2 (conjectured). - Ralf Stephan, Jul 05 2013.  The conjecture is correct because 1+Sum_{e>=1} binomial(2,e)/p^(e*s) = (p^s+1)^2/p^2s, whose product over p is zeta(s)^2/zeta(2s)^2. - Michael Shamos
a(n) = Sum_{k=1..A000005(n)} A225817(n,k)*A225817(n,n+1-k). - Reinhard Zumkeller, Jul 30 2013
G.f. A(x) satisfies: A(x) = x - Sum_{k>=2} tau(k)*A(x^k), where tau = A000005. - Ilya Gutkovskiy, May 11 2019
Sum_{k=1..n} abs(a(k)) ~ (n/zeta(2)^2) * (log(n) + 2*gamma - 1 - 4*zeta'(2)/zeta(2)), where gamma is Euler's constant (A001620). - Amiram Eldar, Dec 24 2023

Added a proof of Stephan's conjecture about the Dirichlet g.f. of |a(n)|.

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)

A011379 a(n) = n^2*(n+1).

Original entry on oeis.org

0, 2, 12, 36, 80, 150, 252, 392, 576, 810, 1100, 1452, 1872, 2366, 2940, 3600, 4352, 5202, 6156, 7220, 8400, 9702, 11132, 12696, 14400, 16250, 18252, 20412, 22736, 25230, 27900, 30752, 33792, 37026, 40460, 44100, 47952, 52022, 56316, 60840

Offset: 0

Glen Burch (gburch(AT)erols.com), Felice Russo

(1) a(n) = sum of second string of n triangular numbers - sum of first n triangular numbers, or the 2n-th partial sum of triangular numbers (A000217) - the n-th partial sum of triangular numbers (A000217). The same for natural numbers gives squares. (2) a(n) = (n-th triangular number)*(the n-th even number) = n(n+1)/2 * (2n). - Amarnath Murthy, Nov 05 2002
Let M(n) be the n X n matrix m(i,j)=1/(i+j+x), let P(n,x) = (Product_{i=0..n-1} i!^2)/det(M(n)). Then P(n,x) is a polynomial with integer coefficients of degree n^2 and a(n) is the coefficient of x^(n^2-1). - Benoit Cloitre, Jan 15 2003
Y values of solutions of the equation: (X-Y)^3-X*Y=0. X values are a(n)=n*(n+1)^2 (see A045991) - Mohamed Bouhamida, May 09 2006
a(2d-1) is the number of self-avoiding walk of length 3 in the d-dimensional hypercubic lattice. - Michael Somos, Sep 06 2006
a(n) mod 10 is periodic 5: repeat [0, 2, 2, 6, 0]. - Mohamed Bouhamida, Sep 05 2009
This sequence is related to A005449 by a(n) = n*A005449(n)-sum(A005449(i), i=0..n-1), and this is the case d=3 in the identity n^2*(d*n+d-2)/2 - Sum_{k=0..n-1} k*(d*k+d-2)/2 = n*(n+d)*(2*d*n+d-3)/6. - Bruno Berselli, Nov 18 2010
Using (n, n+1) to generate a primitive Pythagorean triangle, the sides will be 2*n+1, 2*(n^2+n), and 2*n^2+2*n+1. Inscribing the largest rectangle with integral sides will have sides of length n and n^2+n. Side n is collinear to side 2*n+1 of the triangle and side n^2+n is collinear to side 2*(n^2+n) of the triangle. The areas of theses rectangles are a(n). - J. M. Bergot, Sep 22 2011
a(n+1) is the sum of n-th row of the triangle in A195437. - Reinhard Zumkeller, Nov 23 2011
Partial sums of A049450. - Omar E. Pol, Jan 12 2013
From Jon Perry, May 11 2013: (Start)
Define a 'stable brick triangle' as:
      -----
      | c |
  ---------
  | a | | b |
  ----------
with a, b, c > 0 and c <= a + b. This can be visualized as two bricks with a third brick on top. The third brick can only be as strong as a+b, otherwise the wall collapses - for example, (1,2,4) is unstable.
a(n) gives the number of stable brick triangles that can be formed if the two supporting bricks are 1 <= a <= n and 1 <= b <= n: a(n) = Sum_{a=1..n} Sum_{b=1..n} Sum_c 1 = n^3 + n^2 as given in the Adamchuk formula.
So for i=j=n=2 we have 4:
   1    2    3    4
  2 2  2 2  2 2  2 2
For example, n=2 gives 2 from [a=1,b=1], 3 from both [a=1,b=2] and [a=2,b=1] and 4 from [a=2,b=2] so a(2) = 2 + 3 + 3 + 4 = 12. (End)
Define the infinite square array m(n,k) by m(n,k) = (n-k)^2 if n >= k >= 0 and by m(n,k) = (k+n)*(k-n) if 0 <= n <= k. This contains A120070 below the diagonal. Then a(n) = Sum_{k=0..n} m(n,k) + Sum_{r=0..n} m(r,n), the "hook sum" of the terms to the left of m(n,n) and above m(n,n) with irrelevant (vanishing) terms on the diagonal. - J. M. Bergot, Aug 16 2013
a(n) is the sum of all pairs with repetition drawn from the set of odd numbers 2*n-3. This is similar to A027480 but using the odd integers instead. Example using n=3 gives the odd numbers 1,3,5: 1+1, 1+3, 1+5, 3+3, 3+5,5+5 having a total of 36=a(3). - J. M. Bergot, Apr 05 2016
a(n) is the first Zagreb index of the complete graph K[n+1]. The first Zagreb index of a simple connected graph is the sum of the squared degrees of its vertices. Alternately, it is the sum of the degree sums d(i)+d(j) over all edges ij of the graph. - Emeric Deutsch, Nov 07 2016
a(n-2) is the maximum sigma irregularity over all trees with n vertices.  The extremal graphs are stars.  (The sigma irregularity of a graph is the sum of squares of the differences between the degrees over all edges of the graph.) - Allan Bickle, Jun 14 2023

			a(3) = 3^2+3^3 = 36.

L. B. W. Jolley, "Summation of Series", Dover Publications, 1961, pp. 50, 64.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Bruno Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian).
Allan Bickle and Zhongyuan Che, Irregularities of Maximal k-degenerate Graphs, Discrete Applied Math. 331 (2023) 70-87.
Allan Bickle, A Survey of Maximal k-degenerate Graphs and k-Trees, Theory and Applications of Graphs 0 1 (2024) Article 5.
Ivan Gutman and Kinkar Ch. Das, The first Zagreb index 30 years after, MATCH Commun. Math. Comput. Chem. 50, 2004, 83-92.
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets
J.S. Seneschal, Oblong cuboid illustration
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A000217, A000290, A000292, A000330, A000578, A002378, A002411, A002412, A002413, A005449, A013661, A022549, A027480, A045991, A049450, A120070, A126890, A195437, A245334.
Cf. A011379, A181617, A270205 (sigma irregularities of maximal k-degenerate graphs).
Cf. A028724, A052289.

List([0..40], n-> n^2*(n+1) ); # G. C. Greubel, Aug 10 2019

a011379 n = a000290 n + a000578 n  -- Reinhard Zumkeller, Apr 28 2013

[n^2+n^3: n in [0..40]]; // Vincenzo Librandi, May 02 2011

A011379:=n->n^2*(n+1); seq(A011379(n), n=0..40); # Wesley Ivan Hurt, Feb 25 2014

Table[n^3+n^2, {n,0,40}] (* Vladimir Joseph Stephan Orlovsky, Jan 03 2009, modified by G. C. Greubel, Aug 10 2019 *)
LinearRecurrence[{4,-6,4,-1},{0,2,12,36},40] (* Harvey P. Dale, Sep 13 2018 *)

a(n)=n^3+n^2 \\ Charles R Greathouse IV, Apr 06 2016

[n^2*(n+1) for n in (0..40)] # G. C. Greubel, Aug 10 2019

a(n) = 2*A002411(n).
a(n) = Sum_{j=1..n} (Sum_{i=1..n} (i+j)), row sums of A126890 skipping numbers in the first column. - Alexander Adamchuk, Oct 12 2004
Sum_{n>0} 1/a(n) = (Pi^2 - 6)/6 = 0.6449340... [Jolley eq 272] - Gary W. Adamson, Dec 22 2006
a(n) = 2*n*binomial(n+1,2) = 2*n*A000217(n). - Arkadiusz Wesolowski, Feb 10 2012
G.f.: 2*x*(1 + 2*x)/(1 - x)^4. - Arkadiusz Wesolowski, Feb 11 2012
a(n) = A000330(n) + A002412(n) = A000292(n) + A002413(n). - Omar E. Pol, Jan 11 2013
a(n) = A245334(n+1,2), n > 0. - Reinhard Zumkeller, Aug 31 2014
Sum_{n>=1} 1/a(n) = A013661-1. - R. J. Mathar, Oct 18 2019 [corrected by Jason Yuen, Aug 04 2024]
Sum_{n>=1} (-1)^(n+1)/a(n) = 1 + Pi^2/12 - 2*log(2). - Amiram Eldar, Jul 04 2020
E.g.f.: exp(x)*x*(2 + 4*x + x^2). - Stefano Spezia, May 20 2021
a(n) = n*A002378(n) = A000578(n) + A000290(n). - J.S. Seneschal, Jun 18 2024

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

A060687 Numbers k such that there exist exactly 2 Abelian groups of order k, i.e., A000688(k) = 2.

Original entry on oeis.org

4, 9, 12, 18, 20, 25, 28, 44, 45, 49, 50, 52, 60, 63, 68, 75, 76, 84, 90, 92, 98, 99, 116, 117, 121, 124, 126, 132, 140, 147, 148, 150, 153, 156, 164, 169, 171, 172, 175, 188, 198, 204, 207, 212, 220, 228, 234, 236, 242, 244, 245, 260, 261, 268, 275, 276, 279

Offset: 1

Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 19 2001

k belongs to this sequence iff exactly one prime in its factorization into prime powers has exponent 2 and all the other primes in the factorization have exponent 1, for example 60 = 2^2 * 3 * 5.
Numbers k such that A046660(k) = 1. - Zak Seidov, Nov 14 2012
Numbers that have twice as many unitary divisors as nonunitary divisors, the largest possible ratio for nonsquarefree numbers (i.e., numbers that have nonunitary divisors). - Amiram Eldar, Nov 01 2024

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..5000 from Enrique Pérez Herrero)
Eckford Cohen, Arithmetical notes. VIII. An asymptotic formula of Rényi, Proc. Amer. Math. Soc. 13 (1962), pp. 536-539.
Alfred Rényi, On the density of certain sequences of integers, Publications de l'Institut Mathématique, Vol. 8 (1955), pp. 157-162.
Index entries for sequences related to groups.

Cf. A001221, A001222, A000688, A046660, A271971, A013661, A179119.

a060687 n = a060687_list !! (n-1)
a060687_list = filter ((== 1) . a046660) [1..]
-- Reinhard Zumkeller, Nov 29 2015

Select[Range[500], PrimeOmega[#] - PrimeNu[#] == 1 &] (* Harvey P. Dale, Sep 08 2011 *)

for(n=1,279,if(bigomega(n)-omega(n)==1,print1(n,",")))

is(n)=factorback(factor(n)[,2])==2 \\ Charles R Greathouse IV, Sep 18 2015

list(lim)=my(s=lim\4,v=List(),u=vectorsmall(s,i,1),t,x); forprime(k=2,sqrtint(s), t=k^2; forstep(i=t,s,t, u[i]=0)); forprime(k=2,sqrtint(lim\1), t=k^2; for(i=1,#u, if(u[i] && gcd(k,i)==1, x=t*i; if(x>lim, break); listput(v,x)))); Set(v) \\ Charles R Greathouse IV, Aug 02 2016

from math import isqrt
from sympy import mobius, primerange
def A060687(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        kmin = kmax >> 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def g(x): return sum(mobius(k)*(x//k**2) for k in range(1, isqrt(x)+1))
    def f(x): return int(n+x+sum(sum(g(x//p**j) if j&1 else -g(x//p**j) for j in range(2,x.bit_length())) for p in primerange(isqrt(x)+1)))
    return bisection(f,n,n) # Chai Wah Wu, Feb 24 2025

from sympy import factorint
def is_A060687(n): return sum(v := factorint(n).values()) == len(v) + 1 # David Radcliffe, Jul 28 2025

k such that A001222(k)-A001221(k) = 1.

Cohen proved that a(n) = kn + O(sqrt(n) log log n), where k = A013661/A179119 = 1/A271971 = 4.981178... - Charles R Greathouse IV, Aug 02 2016

Corrected and extended by Vladeta Jovovic, Jul 05 2001

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)

A018892 Number of ways to write 1/n as a sum of exactly 2 unit fractions.

Original entry on oeis.org

1, 2, 2, 3, 2, 5, 2, 4, 3, 5, 2, 8, 2, 5, 5, 5, 2, 8, 2, 8, 5, 5, 2, 11, 3, 5, 4, 8, 2, 14, 2, 6, 5, 5, 5, 13, 2, 5, 5, 11, 2, 14, 2, 8, 8, 5, 2, 14, 3, 8, 5, 8, 2, 11, 5, 11, 5, 5, 2, 23, 2, 5, 8, 7, 5, 14, 2, 8, 5, 14, 2, 18, 2, 5, 8, 8, 5, 14, 2, 14, 5, 5, 2, 23, 5, 5, 5, 11, 2, 23, 5, 8, 5, 5, 5, 17, 2, 8, 8

Offset: 1

Robert G. Wilson v

Number of elements in the set {(x,y): x|n, y|n, x<=y, gcd(x,y)=1}. Number of divisors of n^2 less than or equal to n. - Vladeta Jovovic, May 03 2002
Equivalently, number of pairs (x,y) such that lcm(x,y)=n. - Benoit Cloitre, May 16 2002
Also, number of right triangles with an integer hypotenuse and height n. - Reinhard Zumkeller, Jul 10 2002
The triangles are to be considered as resting on their hypotenuse, with the height measured to the right angle. - Franklin T. Adams-Watters, Feb 19 2015
a(n) >= 2 for n>=2 because of the identities 1/n = 1/(2*n) + 1/(2*n) = 1/(n+1) + 1/(n*(n+1)). - Lekraj Beedassy, May 04 2004
a(n) is the number of divisors of n^2 that are <= n; e.g., a(12) counts these 8 divisors of 12: 1,2,3,4,6,8,9,12. - Clark Kimberling, Apr 21 2019

			n=1: 1/1 = 1/2 + 1/2.
n=2: 1/2 = 1/4 + 1/4 = 1/3 + 1/6.
n=3: 1/3 = 1/6 + 1/6 = 1/4 + 1/12.

K. S. Brown, Posting to netnews group sci.math, Aug 17 1996.
L. E. Dickson, History of The Theory of Numbers, Vol. 2 p. 690, Chelsea NY 1923.
A. M. and I. M. Yaglom, Challenging Mathematical Problems With Elementary Solutions, Vol. 1, Dover, N.Y., 1987, pp. 8 and 60, Problem 19.

T. D. Noe, Table of n, a(n) for n = 1..10000
Jorg Brown, Comparison of records in sigma(n)/phi(n) and A018892.
Roger B. Eggleton, Problem 10501(a), American Mathematical Monthly, Vol. 105, No. 4, (1998), p. 372.
Project Euler, Problem 379: Least common multiple count.

Records: A126097, A126098.
Cf. A000010, A001221, A046079, A048691, A063647, A089233, A184389.
Cf. A001620, A082633, A013661, A201994, A306016.

a018892 n = length [d | d <- [1..n], n^2 `mod` d == 0]
-- Reinhard Zumkeller, Jan 08 2012

f[j_, n_] := (Times @@ (j(Last /@ FactorInteger[n]) + 1) + j - 1)/j; Table[f[2, n], {n, 96}] (* Robert G. Wilson v, Aug 03 2005 *)
a[n_] := (DivisorSigma[0, n^2] + 1)/2; Table[a[n], {n, 1, 99}](* Jean-François Alcover, Dec 19 2011, after Vladeta Jovovic *)

A018892(n)=(numdiv(n^2)+1)/2 \\ M. F. Hasler, Dec 30 2007

A018892s(n)=local(t=divisors(n^2));vector((#t+1)/2,i,[n+t[i],n+n^2/t[i]]) /* show solutions */ \\ M. F. Hasler, Dec 30 2007

a(n)=sumdiv(n,d,sum(i=1,d,lcm(d,i)==n)) \\ Charles R Greathouse IV, Apr 08 2012

from math import prod
from sympy import factorint
def A018892(n): return prod((a<<1)+1 for a in factorint(n).values())+1>>1 # Chai Wah Wu, Aug 20 2023

If n = (p1^a1)(p2^a2)...(pt^at), a(n) = ((2*a1 + 1)(2*a2 + 1) ... (2*at + 1) + 1)/2.
a(n) = (tau(n^2)+1)/2. - Vladeta Jovovic, May 03 2002
a(n) = A063647(n)+1 = A046079(2*n)+1. - Lekraj Beedassy, Dec 01 2003
a(n) = Sum_{d|n} phi(2^omega(d)), where phi is A000010 and omega is A001221. - Enrique Pérez Herrero, Apr 13 2012
a(n) = A000005(n) + A089233(n). - James Spahlinger, Feb 16 2016
a(n) = n + Sum_{i=1..n} sign(n^2 mod -i). - Wesley Ivan Hurt, Apr 07 2021
a(n) = Sum_{d|n} mu(n/d)*A184389(d). - Ridouane Oudra, Feb 22 2022
Sum_{k=1..n} a(k) ~ (n/(2*zeta(2)))*(log(n)^2/2 + log(n)*(3*gamma - 1) + 1 - 3*gamma + 3*gamma^2 - 3*gamma_1 + zeta(2) + (2 - 6*gamma - 2*log(n))*zeta'(2)/zeta(2) + (2*zeta'(2)/zeta(2))^2 - 2*zeta''(2)/zeta(2)), where gamma is Euler's constant (A001620) and gamma_1 is the first Stieltjes constant (A082633). - Amiram Eldar, Oct 03 2024

More terms from David W. Wilson, Sep 15 1996
First example corrected by Jason Orendorff (jason.orendorff(AT)gmail.com), Jan 02 2009
Incorrect Mathematica program deleted by N. J. A. Sloane, Jul 08 2009

cp's OEIS Frontend

A002390 Decimal expansion of natural logarithm of golden ratio.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A060681 Largest difference between consecutive divisors of n (ordered by size).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

Python

Formula

Extensions

A007427 Moebius transform applied twice to sequence 1,0,0,0,....

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

Python

Formula

Extensions

A013665 Decimal expansion of zeta(7).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A013667 Decimal expansion of zeta(9).

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A011379 a(n) = n^2*(n+1).

Views

Author