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 A046485 #23 Oct 13 2019 02:35:11
%S A046485 2,5,10,17,28,129,260,411,592,783,1096,1449,1822,2205,2932,3689,4476,
%T A046485 5273,6192,7121,17422,27923,38524,49835,61246,73667,86388,99209,
%U A046485 112540,126371,140302,154643,169384,184835,200386,216447,232808,249369,266030,283501
%N A046485 Sum of first n palindromic primes A002385.
%C A046485 The subsequence of prime partial sum of palindromic primes begins: 2, 5, 17, 5273, 7121, 154643, 283501. What is the smallest nontrivial (i.e., multidigit) palindromic prime partial sum of palindromic primes? [_Jonathan Vos Post_, Feb 07 2010]
%H A046485 Vincenzo Librandi, <a href="/A046485/b046485.txt">Table of n, a(n) for n = 1..700</a>
%H A046485 Patrick De Geest, <a href="http://www.worldofnumbers.com/palpri.htm">World!Of Palindromic Primes</a>
%F A046485 a(n) = Sum_{i=1..n} A002385(i) = Sum_{i=1..n} {p prime and R(p) = p, i.e., primes whose decimal expansion is a palindrome}. [_Jonathan Vos Post_, Feb 07 2010]
%t A046485 t = {}; b = 10; Do[p = Prime[n]; i = IntegerDigits[p, b]; If[i == Reverse[i], AppendTo[t, p];(*Print[p.FromDigits[i]]*)], {n, 4000}]; Accumulate[t] (* _Vladimir Joseph Stephan Orlovsky_, Feb 23 2012 *)
%t A046485 Accumulate[Select[Prime[Range[10000]],IntegerDigits[#]==Reverse[ IntegerDigits[#]]&]] (* _Harvey P. Dale_, Aug 10 2013 *)
%Y A046485 Cf. A002385, A007504, A046489.
%Y A046485 Cf. A000040, A007500, A006567, A016041, A029732, A117697. [_Jonathan Vos Post_, Feb 07 2010]
%K A046485 nonn,base
%O A046485 1,1
%A A046485 _Patrick De Geest_, Sep 15 1998
%E A046485 Offset set to 1 by _R. J. Mathar_, Feb 21 2010