80569
domain: N
Appears in sequences
- a(n) is the smallest number greater than a(n-1) such that in a(0) through a(n) no digit occurs more than once more than any other digit.at n=46A095204
- 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, 0), (0, 1, 1), (1, -1, 1), (1, 1, -1)}.at n=10A148968
- Number of lower triangles of a 4 X 4 0..n array with each element differing from all of its diagonal, vertical, antidiagonal and horizontal neighbors by one or less.at n=35A195234
- a(n) is the smallest number greater than a(n-1) such that in a(1) through a(n) no digit occurs more than once more than any other digit, starting with a(1) = 1.at n=46A248651
- Numbers k such that replacing each digit d in the decimal expansion of k with d^3 yields a prime each time, when done recursively three times.at n=25A316982