The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082540 Number of ordered quadruples (a,b,c,d) with gcd(a,b,c,d)=1 (1 <= {a,b,c,d} <= n). 15
1, 15, 79, 239, 607, 1199, 2303, 3823, 6223, 9279, 13919, 19183, 27007, 35743, 47519, 60735, 78719, 97103, 122447, 148527, 181839, 216959, 262543, 306863, 365343, 423855, 495855, 569055, 661679, 748527, 862047, 972191, 1104831, 1237247 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{k=1..n} mu(k)*floor(n/k)^4.
a(n) is asymptotic to c*n^4 with c=0.92393....
Lim_{n->infinity} a(n)/n^4 = 1/zeta(4) = A215267 = 90/Pi^4. - Karl-Heinz Hofmann, Apr 11 2021
Lim_{n->infinity} n^4/a(n) = zeta(4) = A013662 = Pi^4/90. - Karl-Heinz Hofmann, Apr 11 2021
PROG
(PARI) a(n)=sum(k=1, n, moebius(k)*floor(n/k)^4)
(Python)
from functools import lru_cache
@lru_cache(maxsize=None)
def A082540(n):
if n == 0:
return 0
c, j = 1, 2
k1 = n//j
while k1 > 1:
j2 = n//k1 + 1
c += (j2-j)*A082540(k1)
j, k1 = j2, n//j2
return n*(n**3-1)-c+j # Chai Wah Wu, Mar 29 2021
CROSSREFS
Sequence in context: A044583 A212746 A212741 * A269657 A189922 A085808
KEYWORD
nonn
AUTHOR
Benoit Cloitre, May 11 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 23:55 EDT 2024. Contains 372497 sequences. (Running on oeis4.)