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 A050766 #18 Jul 03 2017 01:43:22 %S A050766 38431,59333,89753,93683,156007,356441,682141,1226959,1468387,1648697, %T A050766 2592043,2995249,3595589,3933731,5845309,5967433,8861059,8953631, %U A050766 9748537,11351399,12819329,13227023,13712551,16193579,18375053,19294523,21206117,25259593,28297559 %N A050766 Primes occurring in A050765. %H A050766 Donovan Johnson, <a href="/A050766/b050766.txt">Table of n, a(n) for n = 1..500</a> %H A050766 C. Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_066.htm">See also related puzzle</a> %e A050766 Prime 19294523 = composite 19294436 + sopf 2+2+7+7+7+7+7+7+41 = 19294436 + 87 = nextprime(19294436). %t A050766 Reap[For[n = 4, n <= 2*10^7, n = If[PrimeQ[n+1], n+2, n+1], p = NextPrime[n]; If[n + Total[Times @@@ FactorInteger[n] ] == p, Print[p]; Sow[p]]]][[2, 1]] (* _Jean-François Alcover_, Oct 18 2013 *) %Y A050766 Cf. A050765, A050703, A050710. %K A050766 nonn,nice %O A050766 1,1 %A A050766 _Patrick De Geest_, Sep 15 1999 %E A050766 Offset corrected by _Donovan Johnson_, Oct 18 2013