51008
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, -1), (-1, -1, 0), (-1, -1, 1), (0, 1, -1), (1, 0, 1)}.at n=11A148339
- Number of distinct finite languages over 4-ary alphabet, whose minimum regular expression has alphabetic width n.at n=4A211938
- Numbers k such that 7*R_k + 3*10^k - 4 is prime, where R_k = 11...11 is the repunit (A002275) of length k.at n=17A259125