cp's OEIS Frontend

A076490 Number of common (distinct) digits of consecutive prime numbers.

%I A076490 #14 Mar 27 2023 12:43:56
%S A076490 0,0,0,0,1,1,1,0,1,0,1,0,1,1,0,1,0,1,1,1,1,0,1,1,0,2,2,2,1,1,1,2,2,2,
%T A076490 1,2,1,2,2,2,1,1,2,2,2,1,1,1,1,1,2,1,2,2,1,2,1,2,1,2,2,1,1,2,2,2,1,2,
%U A076490 2,1,2,1,2,2,1,2,2,0,2,2,2,2,2,2,2,1,1,1,2,2,2,2,1,2,0,2,1,2,1,2,2,1,2,1,2
%N A076490 Number of common (distinct) digits of consecutive prime numbers.
%H A076490 Reinhard Zumkeller, <a href="/A076490/b076490.txt">Table of n, a(n) for n = 1..10000</a>
%e A076490 1 to 9 common digits for {11 and 13},{101,103},{1031,1033}, {10223,10243},{97213,97231},{126079,126097},{1206479,1206497}, {10186237,10186273},{100438279,100438297} respectively.
%t A076490 Table[Length[Intersection[IntegerDigits[Prime[w]], IntegerDigits[ Prime[ w+1]]]], {w, 1, 200}] (* corrected by _Harvey P. Dale_, May 14 2014 *)
%t A076490 Length[Intersection@@IntegerDigits[#]]&/@Partition[Prime[Range[110]],2,1] (* _Harvey P. Dale_, May 14 2014 *)
%o A076490 (Haskell)
%o A076490 import Data.List (intersect, nub); import Data.Function (on)
%o A076490 a076490 n = a076490_list !! n
%o A076490 a076490_list = map (length . nub) $
%o A076490    zipWith (intersect `on` show) (tail a000040_list) a000040_list
%o A076490 -- _Reinhard Zumkeller_, Sep 01 2013
%o A076490 (PARI) a(n) = my(p=prime(n)); #setintersect(Set(digits(p)), Set(digits(nextprime(p+1)))); \\ _Michel Marcus_, Mar 27 2023
%Y A076490 Cf. A068803, A076489.
%K A076490 base,easy,nonn
%O A076490 1,26
%A A076490 _Labos Elemer_, Oct 21 2002