login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070433 n^2 mod 9. 3
0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1, 4, 0, 7, 7, 0, 4, 1, 0, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,1). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 20 2010]

FORMULA

a(n) = +a(n-9). G.f.: ( -x*(1+x)*(x^6+3*x^5-3*x^4+10*x^3-3*x^2+3*x+1) ) / ( (x-1)*(1+x+x^2)*(x^6+x^3+1) ). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 20 2010]

MATHEMATICA

Table[Mod[n^2, 9], {n, 0, 200}] (* From Vladimir Joseph Stephan Orlovsky, Apr 21 2011 *)

PowerMod[Range[0, 200], 2, 9] (* From Harvey P. Dale, June 11 2011 *)

PROG

(PARI) a(n)=[0, 1, 4, 0, 7, 7, 0, 4, 1][n%9+1] \\ Charles R Greathouse IV, Jun 11 2011

(PARI) a(n)=n^2%9 \\ Charles R Greathouse IV, Jun 11 2011

CROSSREFS

Cf. A070430, A070431, A053879.

Sequence in context: A133930 A077892 A117543 * A169821 A170990 A013666

Adjacent sequences:  A070430 A070431 A070432 * A070434 A070435 A070436

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 12 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.