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 A230500 #16 Dec 23 2024 14:53:43 %S A230500 3,1,2,1,2,1,3,1,2,1,1,3,4,1,2,1,3,1,1,2,1,2,1,3,1,3,2,4,4,1,3,1,3,1, %T A230500 1,1,1,1,3,1,3,1,2,1,2,1,1,3,2,1,8,4,1,1,2,1,1,3,2,2,2,1,2,1,3,1,1,1, %U A230500 1,3,2,2,1,1,1,1,1,3,3,1,1,2,3,1,1,3,1 %N A230500 Indices of "power odious-evil stability" of odd integers 2*n-1 > 1 (see comment). %C A230500 We say that odious 2*n-1, n>=2, has "power odious-evil stability" of index k, if k is the maximal, such that the numbers 2*n-1, (2n-1)^2, ... , (2n-1)^k all are evil or all are odious. %C A230500 For example, 3, 3^2, 3^3 are evil, while 3^4 is odious. So 3 has power stability of index 3. For 5 it is 1, for 7 it is 2, etc. %H A230500 Peter J. C. Moses, <a href="/A230500/b230500.txt">Table of n, a(n) for n = 2..10001</a> %H A230500 Vladimir Shevelev, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2013-October/author.html">"Odious-evil stability" of integers</a> %Y A230500 Cf. A000069, A001969, A230454, A230495, A230496, A230497, A230498. %K A230500 nonn,base %O A230500 2,1 %A A230500 _Vladimir Shevelev_, Oct 21 2013