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 A099069 #11 Aug 11 2017 10:07:34
%S A099069 1,2,3,19,35497
%N A099069 Numbers n such that n = prime(d_1*d_2*...*d_k) - phi(d_1 + d_2 + ... + d_k) where d_1 d_2 ... d_k is the decimal expansion of n.
%C A099069 Sequence is finite since prime(d_1*d_2*...*d_k) <= prime(9^k) <= 9^k(k log 9 + log k + log log 9) < 10^(k-1) for large enough k, i.e., it will have fewer than k digits. In particular, a(n) < 10^69. - _Chai Wah Wu_, Aug 10 2017
%H A099069 C. Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_279.htm">Puzzle 279</a>The Prime Puzzles & Problems connection.
%e A099069 35497 is in the sequence because 35497 = prime(3*5*4*9*7) - phi(3 + 5 + 4 + 9 + 7).
%t A099069 Do[h=IntegerDigits[n];l=Length[h];If[ !MemberQ[h, 0]&&n==Prime[Product[h[[k]], {k, l}]]-EulerPhi[Sum[h[[k]], {k, l}]], Print[n]], {n, 6000000}]
%Y A099069 Cf. A097223, A097227, A099067, A099068.
%K A099069 base,more,nonn,fini
%O A099069 1,2
%A A099069 _Farideh Firoozbakht_, Oct 29 2004