A164704 - OEIS

This site is supported by donations to The OEIS Foundation.

A164704

A006886 mod 9.

1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`The definition implies that if m is A00006886(n) for some n, then m == m^2 mod 9, hence m == 0 or 1 mod 9, as conjectured by Paul Curtz. - N. J. A. Sloane, Aug 23 2009`
	CROSSREFS	`Sequence in context: A037011 A024692 A079978 * A068429 A011747 A089013` `Adjacent sequences: A164701 A164702 A164703 * A164705 A164706 A164707`
	KEYWORD	`nonn,base`
	AUTHOR	`Paul Curtz (bpcrtz(AT)free.fr), Aug 23 2009`
	EXTENSIONS	`Edited and extended by N. J. A. Sloane, Aug 23 2009`

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

Last modified February 15 18:49 EST 2012. Contains 205839 sequences.