67972
domain: N
Appears in sequences
- 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, -1, 0), (-1, 1, -1), (-1, 1, 1), (1, 0, -1), (1, 0, 0)}.at n=11A148270
- Number of 5-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=28A187158
- Least number k not divisible by 10 such that the decimal expansion of k^n contains some digit exactly n times.at n=35A243151
- Least number x such that x^n has n digits equal to k. Case k = 9.at n=35A285456