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 A185893 #12 May 31 2017 22:45:09 %S A185893 101,12101,32321,210101,432121,1012321,1212121,3210101,3210121, %T A185893 3212101,3232321,3432101,5432321,5434321,21212101,21232121,23210101, %U A185893 23232101,43432321,45434321,101012321,101210101,101232121,121232101,123210121,123232121,321012121 %N A185893 Terms in A048398 ending with 1. %C A185893 Among first 114956 terms, number of n-digit terms are: 0, 0, 1, 0, 2, 2, 9, 6, 22, 23, 32, 57, 166, 246, 382, 572, 1770, 2936, 3956, 6183, 18132, 30818, 49641. %H A185893 Chai Wah Wu, <a href="/A185893/b185893.txt">Table of n, a(n) for n = 1..10000</a> %t A185893 Select[Prime[Range[100000]], IntegerDigits[#][[-1]] == 1 && Union[Abs[Differences[IntegerDigits[#]]]] == {1} &] %o A185893 (Python 3.2 or higher) %o A185893 from itertools import product, accumulate %o A185893 from sympy import isprime %o A185893 A185893_list = [] %o A185893 for l in range(1,19): %o A185893 dlist = [1]*l %o A185893 for elist in product([-1,1],repeat=l): %o A185893 flist = [str(d+e) for d,e in zip(dlist,accumulate(elist)) if 0 <= d+e < 10] %o A185893 if len(flist) == l and flist[-1] != '0': %o A185893 n = 10*int(''.join(flist[::-1])) + 1 %o A185893 if isprime(n): %o A185893 A185893_list.append(n) %o A185893 A185893_list = sorted(A185893_list) # _Chai Wah Wu_, May 31 2017 %Y A185893 Cf. A048398, A182781. %K A185893 nonn,base %O A185893 1,1 %A A185893 _Zak Seidov_, Feb 05 2011