32225

Appears in sequences

• Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=14A061364
• Numbers whose digits are prime and which retain this property when multiplied by some 1-digit prime (i.e., one of 2, 3, 5 or 7).at n=20A227922
• Number of nX3 0..1 arrays with every element unequal to 0, 1, 2 or 7 king-move adjacent elements, with upper left element zero.at n=25A304225
• The number of binary Niven numbers (A049445) not exceeding 2^n.at n=17A337078
• Irregular triangle read by rows: T(n,k) is the number of non-isomorphic directed graphs reachable in k >= 0 steps (and no fewer) by n >= 1 agents using the ANY protocol (see A318154).at n=52A383386