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 A178137 #8 Apr 01 2019 16:16:06
%S A178137 2,5,10,17,28,51,94,161,250,351,460,671,894,1127,1560,2003,2680,3467,
%T A178137 4344,5231,6240,7349,8472,9695,11806,14027,16360,19581,22904,26247,
%U A178137 29680,34247,39690,47479,55356,64243,73242,82243,91254,101141,111042
%N A178137 Partial sums of A068148.
%C A178137 Partial sums of primes in which neighboring digits differ at most by 1 (neighbors of 9 are 0 and 8 and 9). The subsequence of primes in this partial sum begins: 5, 17, 2003, 3467, 5231, 7349, 101141, 187367. What is the smallest value in this partial sum (after 5) which is itself a prime in which neighboring digits differ at most by 1? What is the analog in other bases?
%F A178137 a(n) = SUM[i=1..n] A068148(i).
%e A178137 a(16) = 2 + 3 + 5 + 7 + 11 + 23 + 43 + 67 + 89 + 101 + 109 + 211 + 223 + 233 + 433 + 443 = 2003 is prime.
%t A178137 Accumulate[Select[Prime[Range[1500]],Max[Abs[Differences[ IntegerDigits[ #]]] /.{9->1}] <2&]] (* _Harvey P. Dale_, Apr 01 2019 *)
%Y A178137 Cf. A000040, A007504 - Sum of first n primes, A068148.
%K A178137 base,easy,nonn
%O A178137 1,1
%A A178137 _Jonathan Vos Post_, May 20 2010