A068148 Primes in which neighboring digits differ at most by 1.

2, 3, 5, 7, 11, 23, 43, 67, 89, 101, 109, 211, 223, 233, 433, 443, 677, 787, 877, 887, 1009, 1109, 1123, 1223, 2111, 2221, 2333, 3221, 3323, 3343, 3433, 4567, 5443, 7789, 7877, 8887, 8999, 9001, 9011, 9887, 9901, 10009, 10099, 10111, 10909, 10987, 12101, 12109

Offset: 1

Author

Amarnath Murthy, Feb 23 2002

Keywords

• base
• easy
• nonn
• nice

Comments

Neighbors of 9 are 0 and 8 and 9.

Links

• T. D. Noe, Table of n, a(n) for n=1..1000

Crossrefs

Cf. A010051, subsequence of A032981.

Programs

Haskell

a068148 n = a068148_list !! (n-1)
a068148_list = filter ((== 1) . a010051') a032981_list
-- Reinhard Zumkeller, Feb 14 2015

Mathematica

Do[a = IntegerDigits[ Prime[n]]; k = 1; l = Length[a]; While[k < l && (Abs[a[[k]]- a[[k + 1]]] < 2 || Abs[a[[k]] - a[[k + 1]]] > 8), k++ ]; If[k == l, Print[ Prime[n]]], {n, 1, 10^4} ]
Select[Prime[Range[1500]],Max[Abs[Differences[IntegerDigits[#]]]/.{9->1}] < 2&] (* Harvey P. Dale, Jan 31 2012 *)

Extensions

Edited and extended by Robert G. Wilson v and Sascha Kurz, Mar 01 2002

Corrected by T. D. Noe, Feb 15 2008