proposed
approved
proposed
approved
editing
proposed
Amiram Eldar, <a href="/A351979/b351979.txt">Table of n, a(n) for n = 1..10000</a>
Sum_{n>=1} 1/a(n) = 1/Product_{k>=1} (1 - 1/prime(2*k-1)^2) = 1.4135142... . - Amiram Eldar, Sep 19 2022
approved
editing
proposed
approved
editing
proposed
(Python)
from sympy import factorint, primepi
def ok(n):
return all(primepi(p)%2==1 and e%2==0 for p, e in factorint(n).items())
print([k for k in range(15500) if ok(k)]) # Michael S. Branicky, Mar 12 2022
proposed
editing
editing
proposed
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798, reverse A296150, sum A056239, length A001222.
A number's prime signature is the sequence of positive exponents in its prime factorization, which is row n of A124010, sorted A118914, length A001221, sum A001222.
Also Heinz numbers of integer partitions with all odd parts and all even multiplicities, counted by A055922 aeratedA035457 (see Emeric Deutsch's comment there).
100: prime(1)^2 * prime(3)^2
400: prime(1)^4 * prime(3)^2
484: prime(1)^2 * prime(5)^2
1156: prime(1)^2 * prime(7)^2
1600: prime(1)^6 * prime(3)^2
1936: prime(1)^4 * prime(5)^2
A162641 counts even prime exponents, odd A162642.
A257991 counts odd prime indices, even A257992.
Cf. A000720, A028260, `A045931, A055396, A061395, `A106529, `~A130780, `~A171966, A181819, A195017, ~`A239241, A241638, `A276078, `A324517, `~A324524, ~`A324525, `~A324571, ~A324572, `A324588, `A325127, `A325128, `~A325130, A325698, A325700.