91613
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), (0, 1, 1), (1, 0, 1), (1, 1, 0)}.at n=8A151144
- Number of length n+3 0..1 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=22A256818
- Numbers k such that (203*10^k + 1)/3 is prime.at n=20A293034