A261092 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A261092

First differences of A261093; characteristic function for A219640.

1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

COMMENTS

a(n) = number of ways to express n as a sum of nonzero terms of A000071 in such a way that no term is used twice, and no two consecutive terms are used at the same time. For 0 we have one solution, an empty sum, thus a(0) = 1.

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..6765

FORMULA

a(0) = 1; a(n) = A261093(n) - A261093(n-1).

PROG

(Scheme) (define (A261092 n) (if (zero? n) 1 (- (A261093 n) (A261093 (- n 1)))))

CROSSREFS

Cf. A219640, A261093, A261094, A261095.

Cf. also A079559, A230412 (analogous sequences for other bases), A000071.

Sequence in context: A343159 A155091 A145362 * A285960 A174600 A265186

Adjacent sequences: A261089 A261090 A261091 * A261093 A261094 A261095

KEYWORD

nonn

AUTHOR

Antti Karttunen, Aug 08 2015

STATUS

approved