STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
reviewed
approved
proposed
reviewed
editing
proposed
a(n) is the number of nonempty subsets of {1,2,...,n} such that the difference of successive elements is at most 2. See example below. Generally, the o.g.f. for the number of nonempty subsets of {1,2,...,n} such that the difference of successive elements is <= k is: x/((1-x)*(1-2*x+x^(k+1))). Cf. A000217 the case for k=1, A001477 the case for k=0 (counts singleton subsets). - Geoffrey Critzer, Feb 17 2012
approved
editing
editing
approved
a(n) = Sum_{k=1..n} C(n-k+2,k+1). - Paolo P. Lava, Apr 16 2008
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed