id:A164704 - OEIS Search Results

Search: id:A164704

Displaying 1-1 of 1 results found.

page 1

A006886 mod 9.

+0
1

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

	OFFSET	`1,1`
	COMMENT	`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 this_sequence A068429 A011747 A089013` `Adjacent sequences: A164701 A164702 A164703 this_sequence A164705 A164706 A164707`
	KEYWORD	`nonn`
	AUTHOR	`Paul Curtz (bpcrtz(AT)free.fr), Aug 23 2009`
	EXTENSIONS	`Edited and extended by N. J. A. Sloane, Aug 23 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research