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 A120821 #18 Apr 08 2025 22:05:35
%S A120821 1,179,529,62625
%N A120821 a(n) consecutive digits ascending beginning with the digit 3 give a prime.
%C A120821 Digits are in ascending order beginning with 3 and after 9 comes 0.
%C A120821 The sequence "a(n) consecutive digits descending beginning with the digit 3 give a prime." has only one term, 1 which represents the prime 3.
%C A120821 a(5) > 10^5. - _Michael S. Branicky_, Apr 08 2025
%t A120821 fQ[n_] := PrimeQ@ FromDigits@ Mod[2+Range@n, 10]; lst = {}; Do[ If[fQ@n, AppendTo[lst, n]; Print@n], {n, 10000}]; lst
%Y A120821 Cf. A006055, A120819, A120820, A120822, A120823, A120824, A120825, A120826, A120827.
%K A120821 nonn,base,hard,more
%O A120821 1,2
%A A120821 _Robert G. Wilson v_, Jul 05 2006
%E A120821 a(4) from _Michael S. Branicky_, Apr 03 2025