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 A074871 #10 Jul 19 2015 01:17:07
%S A074871 0,1,1,0,1,0,1,0,0,0,1,1,1,0,1,1,2,1,0,1,1,0,1,0,1,2,1,2,1,1,1,1,2,1,
%T A074871 1,2,2,2,1,0,0,0,1,0,1,0,1,2,2,1,1,1,1,1,2,1,1,1,3,0,1,2,2,0,1,3,2,2,
%U A074871 1,1,2,1,2,1,1,2,1,1,2,0,1,2,2,2,1,2,1,2,1,0,0,1,1,2,3,1,2,1,1,0,1,1,0,1,0
%N A074871 Start with n and repeatedly apply the map k -> T(k) = A053837(k) + A171765(k); a(n) is the number of steps (at least one) until a prime is reached, or 0 if no prime is ever reached.
%C A074871 The first occurrence of k beginning with 0: 1, 2, 17, 59, 337, 779, 16999, 6888888, ..., . - _Robert G. Wilson v_, Oct 20 2010
%e A074871 T(2)=2. So in one step we reach a prime.
%e A074871 T(3)=3 and then in one step again we reach a prime.
%e A074871 T(4)=4 and we will never reach a prime.
%e A074871 T(11)=1+2=3 and again in one step we reach a prime.
%e A074871 T(17)=7+8=15 --> T(15)=5+6=11 and then in two steps we reach a prime.
%e A074871 T(13)=3+4=7 and then 1 step......
%e A074871 T(14)=4+5=9 --> T(9)=9 --> T(9)=9........ and we will never reach a prime.
%t A074871 g[n_] := Block[{id = IntegerDigits@ n}, Mod[ Plus @@ id, 10] + If[n < 10, 0, Times @@ id]]; f[n_] := Block[{lst = Rest@ NestWhileList[g, n, UnsameQ, All]}, lsp = PrimeQ@ lst; If[ Last@ Union@ lsp == False, 0, Position[lsp, True, 1, 1][[1, 1]]]]; Array[f, 105] (* _Robert G. Wilson v_, Oct 20 2010 *)
%Y A074871 Cf. A053837, A171765. See A171772 for another version.
%K A074871 easy,nonn,base
%O A074871 1,17
%A A074871 _Felice Russo_, Sep 12 2002, Oct 11 2010
%E A074871 Edited by _N. J. A. Sloane_, Oct 12 2010
%E A074871 More terms from _Robert G. Wilson v_, Oct 20 2010