62535
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, 0, 1), (-1, 1, 0), (1, 0, 1), (1, 1, -1)}.at n=9A149415
- Number of length-n 0..4 arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=6A268453
- T(n,k)=Number of length-n 0..k arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=51A268457
- Number of length-7 0..n arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=3A268461
- Number of partitions of n such that 5*(greatest part) >= (number of parts).at n=42A347869