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 A074672 #17 Jul 28 2025 06:21:25
%S A074672 4,6,6,8,6,16,68,12,58,2,24,4,2,4,24,42,38,22,8,30,12,18,30,36,6,10,
%T A074672 14,36,48,10,6,6,8,70,20,16,14,1050,6,6,24,24,250,32,30,28,20,16,6,8,
%U A074672 10,6,36,8,22,14,6,48,10,6,6,30,8,6,36,4,20,46,44,40,14,46
%N A074672 Differences between successive five-digit distinct-digit primes.
%C A074672 There are exactly 2529 five-digit primes with all distinct digits, so the sequence of differences is finite as well. The end of the sequence is: 42, 18, 80, 42, 30, 10, 38, 22, 38, 22, 30, 38, 162, 28, 2, 18, 156, 24, 6, 10, 66, 20, 64, 6, 38, 6, 60, 4, 6, 20, 60, 46, 14, 6, 34, 36, 18, 2, 10, 48, 6, 14, 72, 18.
%H A074672 Harvey P. Dale, <a href="/A074672/b074672.txt">Table of n, a(n) for n = 1..2528</a> (Complete list of all terms)
%e A074672 a(1)=4 because the first and second five-digit primes with all distinct digits are 10243, 10247 and difference between them is 4.
%t A074672 se=Select[Range[10243, 98731, 2], Length[Union[IntegerDigits[ # ]]]==5&&PrimeQ[ # ]&]; Flatten[Table[{se[[i+1]]-se[[i]]}, {i, 2528}]]
%t A074672 Differences[Select[Prime[Range[PrimePi[10000]+1,PrimePi[99999]]],Max[ DigitCount[ #]] ==1&]] (* _Harvey P. Dale_, Jul 19 2019 *)
%Y A074672 The first differences of the A074671. For 3-digit distinct-digit primes, see A074675, A074676. For 4-digit distinct-digit primes, see A074673, A074674. For 6-digit distinct-digit primes, see A074669, A074670. For 7-digit distinct-digit primes, see A074667, A074668. For 8-digit distinct-digit primes, see A074665, A074666.
%K A074672 fini,full,nonn,base
%O A074672 1,1
%A A074672 _Zak Seidov_, Aug 30 2002