login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A070919
a(n) = Card{ (x,y,z) | lcm(x,y,z)=n }.
8
1, 7, 7, 19, 7, 49, 7, 37, 19, 49, 7, 133, 7, 49, 49, 61, 7, 133, 7, 133, 49, 49, 7, 259, 19, 49, 37, 133, 7, 343, 7, 91, 49, 49, 49, 361, 7, 49, 49, 259, 7, 343, 7, 133, 133, 49, 7, 427, 19, 133, 49, 133, 7, 259, 49, 259, 49, 49, 7, 931, 7, 49, 133, 127, 49, 343, 7, 133
OFFSET
1,2
COMMENTS
A048691(n) gives Card{ (x,y) | lcm(x,y)=n }.
LINKS
O. Bagdasar, On some functions involving the lcm and gcd of integer tuples, Scientific Publications of the State University of Novi Pazar, Appl. Maths. Inform. and Mech., Vol. 6, 2 (2014), 91-100.
FORMULA
a(n) = Sum_{d|n} A000005(d)^3*A008683(n/d).
Sum_{k>0} a(k)/k^s = (1/zeta(s))*Sum_{k>0} tau(k)^3/k^s.
Multiplicative with a(p^e) = 1+3*e+3*e^2 for prime p and e >= 0. - Werner Schulte, Nov 30 2018
MATHEMATICA
Join[{1}, Table[Product[(k + 1)^3 - k^3, {k, FactorInteger[n][[All, 2]]}], {n, 2, 68}]] (* Geoffrey Critzer, Jan 10 2015 *)
PROG
(PARI) for(n=1, 100, print1(sumdiv(n, d, numdiv(d)^3*moebius(n/d)), ", "))
(PARI) a(n) = vecprod(apply(x->(x+1)^3-x^3, factor(n)[, 2])); \\ Amiram Eldar, Sep 03 2023
KEYWORD
mult,easy,nonn
AUTHOR
Benoit Cloitre, May 20 2002
STATUS
approved