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 A200811 #13 May 30 2025 03:32:01
%S A200811 3,3,3,3,3,3,3,3,5,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
%T A200811 3,3,3,3,3,3,3,3,3,3,7,3,3,3,3,3,3,3,3,3,3,3,3,5,3,3,3,3,3,3,3,3,3,3,
%U A200811 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3
%N A200811 Iterate k -> d(k) until an odd prime is reached, starting from the n-th composite.
%C A200811 a(n) is not 3 for n in {9, 45, 58, 89, 128, 163, 168, ...}.
%H A200811 Charles R Greathouse IV, <a href="/A200811/b200811.txt">Table of n, a(n) for n = 1..10000</a>
%H A200811 Tímea Csajbók and János Kasza, <a href="https://doi.org/10.71352/ac.35.083">Iterating the tau-function</a>, Annales Univ. Sci. Budapest., Sec. Math. 35 (2011), pp. 83-93.
%Y A200811 Cf. A200810, A200815.
%K A200811 nonn
%O A200811 1,1
%A A200811 _Charles R Greathouse IV_, Nov 23 2011