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 A379124 #10 Dec 20 2024 12:35:37 %S A379124 25,25,361,1369,361,25,10201,24025,5041,7225,5041,83521,85849,1369, %T A379124 18769,27889,177241,3969,1092025,1243225,1352569,13225,30625,978121, %U A379124 5822569,69169,70225,458329,83521,97969,6241,2253001,2582449,212521,275625,342225,358801,363609,7502121,45657049,63696361,65626201,78659161 %N A379124 a(n) = A379119(A379121(n)), where A379121 gives those odd squares k for which A379113(k) > 1 and A379119(n) = n/A379113(n). %C A379124 All terms are odd squares (A016754) by definition. %H A379124 Antti Karttunen, <a href="/A379124/b379124.txt">Table of n, a(n) for n = 1..2025</a> %H A379124 <a href="/index/Con#CongruCrossDomain">Index entries for sequences defined by congruent products between domains N and GF(2)[X]</a>. %H A379124 <a href="/index/Ge#GF2X">Index entries for sequences related to polynomials in ring GF(2)[X]</a>. %H A379124 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>. %F A379124 a(n) = A379121(n) / A379123(n). %o A379124 (PARI) forstep(n=1,2^18,2,d=A379113(n^2); if(d>1, print1((n^2)/d,", "))); %Y A379124 Cf. A016754, A114390, A133049, A379113, A379121, A379123, A379125. %K A379124 nonn %O A379124 1,1 %A A379124 _Antti Karttunen_, Dec 18 2024