A089013 - OEIS

This site is supported by donations to The OEIS Foundation.

A089013

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 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,1`
	COMMENTS	`This is just to give a pointer to A088567, A089013 and A014707.`
	LINKS	`N. J. A. Sloane and J. A. Sellers, On non-squashing partitions, Discrete Math., 294 (2005), 259-274.`
	CROSSREFS	`A038189(n)=a(n) if n>0.` `Sequence in context: A164704 A068429 A011747 * A123504 A104015 A173858` `Adjacent sequences: A089010 A089011 A089012 * A089014 A089015 A089016`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Dec 20 2003`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:04 EST 2012. Contains 205969 sequences.