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 A064742 #16 Aug 21 2023 08:24:45
%S A064742 0,1,2,2,1,2,3,3,2,1,2,3,2,1,2,4,4,3,2,1,2,3,3,2,2,3,2,1,2,4,5,2,1,2,
%T A064742 3,2,1,2,3,4,3,2,1,2,5,3,3,4,4,2,3,4,2,2,3,2,1,2,3,2,1,2,5,6,3,2,1,2,
%U A064742 3,3,3,5,2,1,2,4,4,2,4,2,1,2,4,2,2,4,3,2,1,2,6,3,2,4,3,3,3,5,2,1,2,3,3,5,3
%N A064742 Total number of primes (with multiplicity) dividing A064413(n).
%H A064742 J. C. Lagarias, E. M. Rains and N. J. A. Sloane, <a href="https://arxiv.org/abs/math/0204011">The EKG sequence</a>, arXiv:math/0204011 [math.NT], 2002.
%H A064742 J. C. Lagarias, E. M. Rains and N. J. A. Sloane, <a href="https://projecteuclid.org/euclid.em/1057777433">The EKG sequence</a>, Exper. Math. 11 (2002), 437-446.
%H A064742 <a href="/index/Ed#EKG">Index entries for sequences related to EKG sequence</a>
%F A064742 a(n) = A001222(A064413(n)). - _Michel Marcus_, Aug 21 2023
%t A064742 terms = 105;
%t A064742 ekg[s_] := Block[{m = s[[-1]], k = 3}, While[MemberQ[s, k] || GCD[m, k] == 1, k++]; Append[s, k]];
%t A064742 EKG = Nest[ekg, {1, 2}, terms-2];
%t A064742 PrimeOmega /@ EKG (* _Jean-François Alcover_, Sep 02 2018, after _Robert G. Wilson v_ in A064413 *)
%Y A064742 Sum of "digits" of A064743.
%Y A064742 Cf. A001222, A064413.
%K A064742 nonn
%O A064742 1,3
%A A064742 _N. J. A. Sloane_, Oct 18 2001
%E A064742 More terms from _Vladeta Jovovic_, Oct 20 2001