26519

Appears in sequences

• Let u be any string of n digits from {0,...,9}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u; then a(n) = max_u f(u).at n=8A065851
• Number of partitions of 9*n-8 into parts having in decimal representation digital root 1.at n=31A156145