213074
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, 0, 0), (0, 0, 1), (1, 1, 0)}.at n=10A150122
- Positive integers j of the form Sum_{i=1..k} b(i)c(i), i.e., not in A297345 such that there is only one set {c(1),...,c(k)} where the c(i) are drawn with repetition from {b(0),...,b(k)} and b(k+1) is the smallest element of A297345 that is larger than j, where b() is A297345.at n=53A300730