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 A345326 #45 Jul 24 2021 01:41:18
%S A345326 0,4,14,49,125,296,646,1304,2459,4543,7882,13272,21856,34934,53446,
%T A345326 82055,121322,175498,251714,354810,488440,676065,914834,1220629,
%U A345326 1627770,2135954,2759889,3590609,4602572,5830588,7386200,9266652,11469407,14314939,17658240
%N A345326 Number of primes less than 10^n with digits in nonincreasing order.
%C A345326 Number of primes with at most n digits arranged in nonincreasing order.
%H A345326 Michael S. Branicky, <a href="/A345326/b345326.txt">Table of n, a(n) for n = 0..42</a>
%H A345326 <a href="/index/Pri#primepop">Index entries for sequences related to numbers of primes in various ranges</a>
%t A345326 Table[Length@Select[Prime@Range[PrimePi[10^n]],OrderedQ@Reverse@IntegerDigits@#&],{n,0,7}] (* _Giorgos Kalogeropoulos_, Jul 22 2021 *)
%o A345326 (Python)
%o A345326 from sympy import isprime
%o A345326 from itertools import accumulate, combinations_with_replacement as mc
%o A345326 def numwithdigs(d):
%o A345326 if d == 0: return 0
%o A345326 nonincreasing = (int("".join(m)) for m in mc("987654321", d))
%o A345326 return len(list(filter(isprime, nonincreasing)))
%o A345326 def aupto(nn): return list(accumulate(numwithdigs(d) for d in range(nn+1)))
%o A345326 print(aupto(14)) # _Michael S. Branicky_, Jul 22 2021
%Y A345326 Cf. A000040, A006880, A028867, A345325.
%K A345326 nonn,base,hard
%O A345326 0,2
%A A345326 _Ilya Gutkovskiy_, Jul 22 2021
%E A345326 a(12)-a(34) from _Michael S. Branicky_, Jul 22 2021