This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070434 a(n) = n^2 mod 11. 7
 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1, 4, 9, 5, 3, 3, 5, 9, 4, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 FORMULA From R. J. Mathar, Apr 20 2010: (Start) a(n) = a(n-11). G.f.: ( -x*(1+x)*(x^8+3*x^7+6*x^6-x^5+4*x^4-x^3+6*x^2+3*x+1) ) / ( (x-1)*(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10) ). (End) a(n) = A010880(n^2). - Michel Marcus, Mar 24 2016 MATHEMATICA Table[Mod[n^2, 11], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 21 2011 *) PROG (PARI) a(n)=n^2%11 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Cf. A010880, A070430, A070431, A070432. Sequence in context: A011513 A164818 A065796 * A011003 A200011 A200241 Adjacent sequences:  A070431 A070432 A070433 * A070435 A070436 A070437 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, May 12 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 10:32 EDT 2019. Contains 327229 sequences. (Running on oeis4.)