login
A389199
Numbers whose sum of squarefree divisors (A048250) is congruent to 2 modulo 4.
5
5, 10, 13, 17, 20, 25, 26, 29, 34, 37, 40, 41, 50, 52, 53, 58, 61, 68, 73, 74, 80, 82, 89, 97, 100, 101, 104, 106, 109, 113, 116, 122, 125, 136, 137, 146, 148, 149, 157, 160, 164, 169, 173, 178, 181, 193, 194, 197, 200, 202, 208, 212, 218, 226, 229, 232, 233, 241, 244, 250, 257, 269, 272, 274, 277, 281, 289, 292
OFFSET
1,1
COMMENTS
Numbers k such that the odd part of k [= A000265(k)] is a prime power, p^e, e >= 1, and that prime p is of the form 4u+1.
LINKS
FORMULA
{k | A048250(k) == 2 (mod 4)}.
{k | A001221(A000265(k)) == 1 and A020639(A000265(k)) == 1 (mod 4)}.
MATHEMATICA
A389199Q[k_] := k > 1 && Mod[Times @@ (FactorInteger[k][[All, 1]] + 1), 4] == 2;
Select[Range[500], A389199Q] (* Paolo Xausa, Oct 13 2025 *)
PROG
(PARI)
A048250(n) = factorback(apply(p -> p+1, factor(n)[, 1]));
is_A389199(k) = (2==(A048250(k)%4));
(PARI)
A000265(n) = (n>>valuation(n, 2));
A020639(n) = if(1==n, n, vecmin(factor(n)[, 1]));
is_A389199(k) = (1==omega(A000265(k)) && 1==(A020639(A000265(k))%4));
CROSSREFS
Subsequence of A389197, which is a subsequence of A336101.
Sequence in context: A025302 A268379 A221265 * A055096 A313386 A267969
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 06 2025
STATUS
approved