150063

Appears in sequences

• a(n) is the smallest number m such that for the n-digit number s=10^(n-1)+ m, 10*s+1, 10*s+3, 10*s+7 and 10*s+9 are primes.at n=28A097639
• 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, 0), (0, -1, 1), (1, 0, -1), (1, 1, 1)}.at n=9A149782
• Array read by antidiagonals: T(m,n) = number of maximal irredundant sets in the grid graph P_m X P_n.at n=49A291439
• Array read by antidiagonals: T(m,n) = number of maximal irredundant sets in the grid graph P_m X P_n.at n=50A291439