cp's OEIS Frontend

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.

A383979 a(n) is the number of n-digit terms in A383978.

This page as a plain text file.
%I A383979 #45 Aug 27 2025 21:08:12
%S A383979 0,1,15,106,821,6909,58683,509654,4508611,40421003,366300162,
%T A383979 3348975103,30845805300,285887726304,2663962455651,24939375901980
%N A383979 a(n) is the number of n-digit terms in A383978.
%H A383979 Lyle Blosser, <a href="/A383979/a383979_2.py.txt">Python script</a>
%t A383979 a[n_]:=Module[{count=0},For[k=Prime[PrimePi[10^(n-1)]+1], k<=Prime[PrimePi[10^n-1]],k=NextPrime[k],If[Part[d=IntegerDigits[k],l=IntegerLength[k]]==Part[d,l-1],count++]]; count]; Array[a,7]
%o A383979 (Python)
%o A383979 from sympy import isprime
%o A383979 def a(n):
%o A383979     if n < 3: return n-1
%o A383979     return sum(1 for i in range(10**(n-1), 10**n, 100) for k in (11, 33, 77, 99) if isprime(i+k))
%o A383979 print([a(n) for n in range(1, 10)]) # _Michael S. Branicky_, May 20 2025
%Y A383979 Cf. A383978, A384014, A384016.
%K A383979 nonn,base,more,changed
%O A383979 1,3
%A A383979 _Stefano Spezia_, May 16 2025
%E A383979 a(12) from _Michael S. Branicky_, May 20 2025
%E A383979 a(13) from _Michael S. Branicky_, May 27 2025
%E A383979 a(14)-a(15) from _Lyle Blosser_, Jul 09 2025
%E A383979 a(15) corrected by _Lyle Blosser_, Aug 09 2025
%E A383979 a(16) from _Lyle Blosser_, Aug 23 2025