This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A111159 #6 May 25 2024 20:52:44 %S A111159 1,3,4,6,12,16,24,25,27,48,49,54,64,75,96,100,108,121,147,150,169,192, %T A111159 196,216,243,256,289,294,300,361,363,384,400,432,484,486,507,529,588, %U A111159 600,625,675,676,726,768,784,841,864,867,961,972,1014,1024 %N A111159 Numbers k such that A111075(k) is odd. %F A111159 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 A111159 It is not difficult to show that the conjecture is true. - _Max Alekseyev_, Oct 12 2005 %Y A111159 Cf. A028982, A111075. %K A111159 nonn %O A111159 1,2 %A A111159 _Paul D. Hanna_, Oct 12 2005