Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 May 25 2024 20:52:44
%S 1,3,4,6,12,16,24,25,27,48,49,54,64,75,96,100,108,121,147,150,169,192,
%T 196,216,243,256,289,294,300,361,363,384,400,432,484,486,507,529,588,
%U 600,625,675,676,726,768,784,841,864,867,961,972,1014,1024
%N Numbers k such that A111075(k) is odd.
%F Conjecture: A111075(n) is odd whenever: (i) n = m^2 for all m>=1 such that 3 does not divide m, or (ii) n = 3*A028982(m) for all m>=1. Also, A028982 gives "Union of nonzero squares and twice squares."
%F It is not difficult to show that the conjecture is true. - _Max Alekseyev_, Oct 12 2005
%Y Cf. A028982, A111075.
%K nonn
%O 1,2
%A _Paul D. Hanna_, Oct 12 2005