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 A345325 #37 Jul 24 2021 01:41:23
%S A345325 0,4,16,50,132,315,689,1413,2636,4967,8563,14481,23593,37127,56809,
%T A345325 86779,127096,184517,264288,368794,510442,707483,948307,1268871,
%U A345325 1689642,2204795,2866855,3729223,4738019,6013021,7619227,9510372,11832748,14770667,18067652
%N A345325 Number of primes less than 10^n with digits in nondecreasing order.
%C A345325 Number of primes with at most n digits arranged in nondecreasing order.
%H A345325 Michael S. Branicky, <a href="/A345325/b345325.txt">Table of n, a(n) for n = 0..42</a>
%H A345325 <a href="/index/Pri#primepop">Index entries for sequences related to numbers of primes in various ranges</a>
%t A345325 Table[Length@Select[Prime@Range[PrimePi[10^n]],OrderedQ@IntegerDigits@#&],{n,0,7}] (* _Giorgos Kalogeropoulos_, Jul 22 2021 *)
%o A345325 (Python)
%o A345325 from sympy import isprime
%o A345325 from itertools import accumulate, combinations_with_replacement as mc
%o A345325 def numwithdigs(d):
%o A345325 if d == 0: return 0
%o A345325 nonincreasing = (int("".join(m)) for m in mc("123456789", d))
%o A345325 return len(list(filter(isprime, nonincreasing)))
%o A345325 def aupto(nn): return list(accumulate(numwithdigs(d) for d in range(nn+1)))
%o A345325 print(aupto(14)) # _Michael S. Branicky_, Jul 22 2021
%Y A345325 Cf. A000040, A006880, A028864, A345326.
%K A345325 nonn,base,hard
%O A345325 0,2
%A A345325 _Ilya Gutkovskiy_, Jul 22 2021
%E A345325 a(11)-a(34) from _Michael S. Branicky_, Jul 22 2021