OFFSET
1,1
COMMENTS
With the exception of 10 and 30, these are numbers k such that k*(phi(k)+2) is divisible by 4, where phi is the Euler totient function (A000010).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
Shahbaz Ali and Khalid Mahmood, New numbers on Euler's totient function with applications, Journal of Mathematical Extension, Vol. 14, No. 1 (2020), pp. 61-83.
EXAMPLE
6 is a term since the set {1, 5, 6} can be partitioned into two disjoint subsets, {1, 5} and {6}, of equal sum.
MATHEMATICA
Select[Range[120], ! MemberQ[{10, 30}, #] && Divisible[# * (EulerPhi[#] + 2), 4] &]
PROG
(PARI) is(n) = n != 10 && n != 30 && !((n * (eulerphi(n) + 2)) % 4);
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Apr 14 2023
STATUS
approved