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 A099068 #10 Aug 12 2017 09:59:21
%S A099068 23,119,428,918,1637682,652827658771
%N A099068 Numbers n such that n=P(d_1)*P(d_2)*...*P(d_k)+(P(d_1)+P(d_2)+...+P(d_k)) where d_1 d_2 ... d_k is the decimal expansion of n and P(i) is the i-th prime.
%C A099068 There is no other term up to 15000000.
%C A099068 a(7) > 10^12. [_Donovan Johnson_, Mar 26 2010]
%C A099068 There are no other terms < 10^44. - _Chai Wah Wu_, Aug 12 2017
%H A099068 C. Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_279.htm">Puzzle 279</a>The Prime Puzzles & Problems connection.
%e A099068 1637682 is in the sequence because 1637682=
%e A099068 P(1)*P(6)*P(3)*P(7)*P(6)*P(8)*P(2)+(P(1)+P(6)+P(3)+P(7)+P(6)+P(8)+P(2)).
%t A099068 Do[h=IntegerDigits[n];l=Length[h];If[ !MemberQ[h, 0]&&n==Product[Prime[h[[k]]], {k, l}]+Sum[Prime[h[[k]]], {k, l}], Print[n]], {n, 15000000}]
%Y A099068 Cf. A099067, A099069, A097223, A097227.
%K A099068 base,more,nonn
%O A099068 1,1
%A A099068 _Farideh Firoozbakht_, Oct 29 2004
%E A099068 Definition corrected by _D. S. McNeil_, Mar 14 2009
%E A099068 a(6) from _Donovan Johnson_, Mar 26 2010