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

Offset

1,1

Comments

The definition implies that if m is A006886(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

Links

Table of n, a(n) for n=1..105.

Crossrefs

Sequence in context: A070563 A024692 A079978 * A245485 A068429 A285208

Adjacent sequences: A164701 A164702 A164703 * A164705 A164706 A164707

Keyword

nonn,base

Author

Paul Curtz, Aug 23 2009

Extensions

Edited and extended by N. J. A. Sloane, Aug 23 2009

Status

approved