99704
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, 0, 1), (0, 1, -1), (1, 0, 0)}.at n=10A149868
- Number of length 5 arrays x(i), i=1..5 with x(i) in i..i+n and no value appearing more than 3 times.at n=8A250363
- E.g.f.: exp( exp(x) * (exp(x) - 1 - x - x^2 / 2) ).at n=10A347434
- a(n) = number of subsets S of {1,2,...,n} having more than 2 elements such that (sum of least three elements of S) = max(S).at n=23A357287