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 A146562 #6 Jul 22 2025 06:15:03 %S A146562 3,6,9,15,18,21,25,29,32,35,41,44,47,51,54,57,61,64,67,73,76,79,83,87, %T A146562 90,93,99,102,105,109,112,115,121,124,127,131,134,137,143,146,149,153, %U A146562 157,160,163,169,172,175,179,182,185,189,192,195,201,204,207,211 %N A146562 'Erratic' numbers in A064353 [Kolakoski (1,3)]. %C A146562 A064353(n) is generally 1 if n is odd and 3 if n is even. An 'erratic' number breaks this rule. %H A146562 Reinhard Zumkeller, <a href="/A146562/b146562.txt">Table of n, a(n) for n = 1..10000</a> %e A146562 A064353(3) is predicted to be 1 but is 3 so 3 is in the list. %o A146562 (Haskell) %o A146562 import Data.List (findIndices) %o A146562 a146562 n = a146562_list !! (n-1) %o A146562 a146562_list = map (+ 1) $ %o A146562 findIndices (/= 0) $ zipWith (-) a064353_list $ cycle [1, 3] %o A146562 -- _Reinhard Zumkeller_, Aug 03 2013 %Y A146562 Cf. A064353. %Y A146562 Cf. A010684. %K A146562 nonn %O A146562 1,1 %A A146562 J. Perry (johnandruth(AT)jrperry.orangehome.co.uk), Nov 01 2008