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 A364133 #35 Sep 03 2023 10:30:29 %S A364133 1,2,3,4,5,10,1034,1619,19940,151012,185354,937444,17714660,30594058, %T A364133 53467077,401540691,1127208901,34761279059,1529978475530, %U A364133 12645510928325 %N A364133 Index k of A007814(A000127(k)) at record terms. %C A364133 For polynomial sequences like A000127 we can always find a recurrence formula, and with that you can show that all polynomial sequences mod m will be periodic. Terms of this sequence were found using A000127(k) mod 2^x, with a recursion formula, treating each k separately. This method limits the size of working quantities. %C A364133 This sequence is related to the question: Is there a another power of 2 among Moser's circle numbers? %H A364133 Burkard Polster, <a href="https://www.youtube.com/watch?v=4AuV93LOPcE">Why don't they teach Newton's calculus of 'What comes next?'</a>, YouTube video, Oct 02 2021. %H A364133 Kevin Ryde, <a href="/A364133/a364133.gp.txt">PARI/GP Code</a> %H A364133 Grant Sanderson, <a href="https://www.youtube.com/watch?v=YtkIWDE36qU">The absurd circle division pattern (updated) | Moser's circle problem</a>, YouTube video, Jul 02 2023. %Y A364133 Cf. A000127, A007814. %K A364133 nonn,more %O A364133 0,2 %A A364133 _Nicolas Bělohoubek_, Jul 10 2023