109866
domain: N
Appears in sequences
- a(0) = a(1) = 1; for n >= 2, a(n) = a(n-1) + a(n-2) - n if that number is positive and not already in the sequence, otherwise a(n) = a(n-1) + a(n-2) + n.at n=26A117821
- Number of equivalence classes of 3-binomial complexity for binary words of length n.at n=17A258585
- Number of grains of sand required to be added to one cell at the origin in an initially empty and infinite 3D cubic grid for the 3D sandpile model such that the distance from the origin of the furthest nonempty cell along the axes is n.at n=20A351783