id:A089013 - OEIS Search Results

Search: id:A089013

Displaying 1-1 of 1 results found.

page 1

A088567(8n) mod 2.

+0
1

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; listen)

	OFFSET	`0,1`
	COMMENT	`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.` `Adjacent sequences: A089010 A089011 A089012 this_sequence A089014 A089015 A089016` `Sequence in context: A079978 A068429 A011747 this_sequence A123504 A104015 A101266`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, Dec 20 2003`

page 1

Search completed in 0.002 seconds

Last modified October 15 20:12 EDT 2008. Contains 145099 sequences.

AT&T Labs Research