OFFSET
0,2
COMMENTS
LINKS
FORMULA
PROG
(PARI)
allocatemem(234567890);
default(primelimit, 2^22)
uplim_for_13928 = 13123111;
v013928 = vector(uplim_for_13928); A013928(n) = v013928[n];
v013928[1]=0; n=1; while((n < uplim_for_13928), if(issquarefree(n), v013928[n+1] = v013928[n]+1, v013928[n+1] = v013928[n]); n++);
A019565(n) = {factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ This function from M. F. Hasler
for(n=0, 478, write("b246353.txt", n, " ", A246353(n)));
(Scheme) (definec (A246353 n) (let loop ((n n) (i 1) (p 1)) (cond ((zero? n) (A013928 (+ 1 p))) ((odd? n) (loop (/ (- n 1) 2) (+ 1 i) (* p (A000040 i)))) (else (loop (/ n 2) (+ 1 i) p)))))
(Python)
from math import prod, isqrt
from sympy import prime, mobius
def A246353(n):
m = prod(prime(i) for i, j in enumerate(bin(n)[-1:1:-1], 1) if j=='1')
return int(sum(mobius(k)*(m//k**2) for k in range(1, isqrt(m)+1))) # Chai Wah Wu, Feb 22 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 23 2014
STATUS
approved