

A349753


Odd numbers k for which A003961(k)2k divides A003961(k)sigma(k), where A003961 shifts the prime factorization one step towards larger primes, and sigma is the sum of divisors function.


2



1, 3, 7, 25, 33, 55, 57, 69, 91, 93, 2211, 4825, 12639, 28225, 32043, 68727, 89575, 970225, 2245557, 16322559, 22799825, 48980427, 55037217, 60406599, 68258725, 325422273, 414690595, 569173299, 794579511, 10056372275, 10475647197, 10759889913, 11154517557
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

The odd terms of A326134 form a subsequence of this sequence. Unlike in A326134, here we don't constrain the value of A252748(k) = A003961(k)2k, thus allowing also values <= +1. Because of that, the odd terms of A048674 and A348514 are all included here, for example 57 and 68727 that occur in A348514, and 1, 3, 25, 33, 93, 970225, 325422273, 414690595 that occur in A048674.
Conjecture (1): This is a subsequence of A319630, in other words, for all terms k, gcd(k, A003961(k)) = 1.
Conjecture (2): Apart from 1, there are no common terms with A349169, which would imply that no odd perfect numbers exist.


LINKS



MATHEMATICA

f[p_, e_] := NextPrime[p]^e; s[1] = 1; s[n_] := Times @@ f @@@ FactorInteger[n]; q[n_] := Divisible[(sn = s[n])  DivisorSigma[1, n], sn  2*n]; Select[Range[1, 10^6, 2], q] (* Amiram Eldar, Dec 04 2021 *)


PROG

(PARI)
A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
isA349753(n) = if(!(n%2), 0, my(s = A003961(n), t = (s(2*n)), u = ssigma(n)); !(u%t));


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



