40045

Appears in sequences

• Let u be any string of n digits from {0,...,4}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-5 number; then a(n) = max_u f(u).at n=10A065846
• (Prime(prime(n))^2+1)/2.at n=17A092773
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (-1, 1, 1), (1, -1, 0), (1, 0, -1), (1, 1, 1)}.at n=8A149804
• Partial sums of A206032 (Product_{d|n} sigma(d)).at n=15A280085