A072778 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A072778

Number of powers of squarefree numbers <= n.

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 11, 12, 13, 14, 15, 16, 16, 17, 17, 18, 19, 20, 20, 21, 22, 23, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 34, 35, 36, 37, 37, 37, 38, 39, 39, 40, 40, 41, 41, 42, 42, 43, 43, 44, 45, 46, 46, 47, 48, 48, 49, 50, 51, 52, 52, 53, 54, 55, 55

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..72.

PROG

(Python)

from math import isqrt

from sympy import mobius, integer_nthroot

def A072778(n):

def f(x): return int(sum(mobius(k)*(x//k**2) for k in range(1, isqrt(x)+1)))

return 2-(m:=n.bit_length())+sum(f(integer_nthroot(n, k)[0]) for k in range(1, m)) # Chai Wah Wu, Aug 19 2024