A089013 a(n) = (A088567(8n) mod 2).

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

Offset

0,1

Comments

This is just to give a pointer to A088567, A089013 and A014707.

Links

Table of n, a(n) for n=0..107.

N. J. A. Sloane and J. A. Sellers, On non-squashing partitions, arXiv:math/0312418 [math.CO], 2003.

N. J. A. Sloane and J. A. Sellers, On non-squashing partitions, Discrete Math., 294 (2005), 259-274.

Index entries for sequences obtained by enumerating foldings

Formula

a(0) = 1, a(2*n) = a(n) for n > 0 and a(2*n+1) = (n mod 2) for n >= 0. - A.H.M. Smeets, Aug 02 2018

Crossrefs

A038189(n)=a(n) if n>0.

Sequence in context: A260444 A289034 A011747 * A188374 A123504 A273511

Adjacent sequences: A089010 A089011 A089012 * A089014 A089015 A089016

Keyword

nonn,easy

Author

N. J. A. Sloane, Dec 20 2003

Status

approved