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 A162705 #18 Feb 27 2019 03:48:44
%S A162705 582,1026,1032,1038,1092,1122,1128,1134,1152,1296,1644,1716,4152,4344,
%T A162705 4602,4932,5068,5562,5808,8706,8862,8988,9012,9036,9066,9264,9726,
%U A162705 10110,10308,10326,10342,10398,10638,10698,10764,10794,10806,10866,10912,10944,10998
%N A162705 Numbers that are the sum of two reversed consecutive primes in more than one way.
%C A162705 Subsequence of A162704. - _R. J. Mathar_, Jul 13 2009
%H A162705 Sean A. Irvine, <a href="/A162705/b162705.txt">Table of n, a(n) for n = 1..115</a>
%e A162705 582 = R(191) + R(193) = 191 + 391 and R(683) + R(691) = 386 + 196.
%e A162705 1032 = R(113) + R(127) = 311 + 721 = R(613) + R(617) = 316 + 716.
%p A162705 read("transforms") ; A055642 := proc(n) max(1, ilog10(n)+1) ; end:
%p A162705 A004087 := proc(n) option remember; digrev(ithprime(n)) ; end:
%p A162705 isA162705 := proc(n) c := 0 ; for i from 1 do p := ithprime(i) ; if A055642(p) > A055642(n) then break; fi; if A004087(i)+A004087(i+1) = n then c := c+1; fi; od: RETURN(c > 1); end:
%p A162705 for n from 1 to 10000 do if isA162705(n) then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jul 13 2009
%t A162705 Sort[Transpose[Select[Tally[FromDigits[Reverse[IntegerDigits[#[[1]]]]] + FromDigits[Reverse[IntegerDigits[#[[2]]]]]&/@Partition[Prime[Range[ 2000]],2,1]],Last[#]>1&]][[1]]] (* _Harvey P. Dale_, Nov 14 2012 *)
%Y A162705 Cf. A004087, A162704.
%K A162705 nonn,base
%O A162705 1,1
%A A162705 _Claudio Meller_, Jul 11 2009
%E A162705 Keyword:base plus more terms from _R. J. Mathar_, Jul 13 2009
%E A162705 Typo in first example corrected by _R. J. Mathar_, Jul 22 2009
%E A162705 More terms from _Sean A. Irvine_, Nov 14 2010