cp's OEIS Frontend

A068863 a(1) = 2; a(n+1) is the smallest prime not already in the sequence which differs from a(n) at every digit.

%I A068863 #14 Mar 19 2024 03:32:05
%S A068863 2,3,5,7,11,23,17,29,13,31,19,37,41,53,47,59,43,61,73,67,71,83,79,97,
%T A068863 89,101,223,107,211,103,227,109,233,127,239,113,229,131,257,139,241,
%U A068863 137,251,149,263,151,269,157,271,163,277,181,293,167,281,173,307,179
%N A068863 a(1) = 2; a(n+1) is the smallest prime not already in the sequence which differs from a(n) at every digit.
%H A068863 Reinhard Zumkeller, <a href="/A068863/b068863.txt">Table of n, a(n) for n = 1..10000</a> [Corrected by _Sean A. Irvine_, Mar 19 2024]
%e A068863 13 follows 29 as the smallest prime number not included earlier and differing at every digit position with 29.
%o A068863 (Haskell)
%o A068863 import Data.List (delete)
%o A068863 a068863 n = a068863_list !! (n-1)
%o A068863 a068863_list = f "x" (map show a000040_list) where
%o A068863    f p ps = g ps where
%o A068863      g (q:qs)
%o A068863        | and $ zipWith (/=) p q = (read q :: Int) : f q (delete q ps)
%o A068863        | otherwise = g qs
%o A068863 -- _Reinhard Zumkeller_, Dec 21 2013 [Warning: this code might not be correct - _Sean A. Irvine_, Mar 19 2024]
%Y A068863 Cf. A068853.
%Y A068863 Cf. A085136.
%Y A068863 Cf. A068861.
%K A068863 nonn,base
%O A068863 1,1
%A A068863 _Amarnath Murthy_, Mar 13 2002
%E A068863 Corrected and extended by _Sascha Kurz_, Feb 02 2003