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 A157789 #15 Feb 01 2021 02:25:08 %S A157789 317130731,521142283,557010073,1000702693,1281321101,1613435111, %T A157789 1802692181,2010808001,2012656781,2238160121,2352422231,3361114331, %U A157789 4302122501,4902109481,5044120093,6276507313,6542906413,7230842923 %N A157789 Primes p such that consecutive primes p < q < r < s all are additive pointer-primes A089824. %C A157789 We may call these primes the additive pointer-primes of 4th order (and then A089824 are additive pointer-primes of first order). %C A157789 Are there additive pointer-primes of higher than 4th order? %C A157789 The only known 5th-order additive pointer-prime < 10^12 is 102342031273 (_Donovan Johnson_, Oct 25 2009). %C A157789 The first 10 5th-order additive pointer-primes are 102342031273, 1012835563819, 1070302300183, 2350811300953, 3063433129909, 3104103122173, 3551303300933, 5262316326901, 5426670290957, 6104611400971. The first 6th-order additive pointer-prime is 63604045061911. - _Giovanni Resta_, Jan 14 2013 %H A157789 Donovan Johnson, <a href="/A157789/b157789.txt">Table of n, a(n) for n=1..345</a> %H A157789 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_163.htm">Puzzle 163. P+SOD(P)</a>, The Prime Puzzles and Problems Connection. %e A157789 p=317130731, q=317130757, r=317130791, s=317130823, t=317130851; %e A157789 p + sod (p) = q, q + sod (q) = r, r + sod (q) = s, s + sod (s) =t; %e A157789 p<q<r<s<t are consecutive primes, sod(m)=A007953(m). %Y A157789 Cf. A007953 Digital sum (i.e., sum of digits) of m, A089824 Primes p such that the next prime after p can be obtained from p by adding the sum of the digits of p. %K A157789 base,nonn %O A157789 1,1 %A A157789 _Zak Seidov_, Mar 06 2009 %E A157789 a(13)-a(18) from _Donovan Johnson_, Oct 11 2009