This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070436 a(n) = n^2 mod 13. 3
 0, 1, 4, 9, 3, 12, 10, 10, 12, 3, 9, 4, 1, 0, 1, 4, 9, 3, 12, 10, 10, 12, 3, 9, 4, 1, 0, 1, 4, 9, 3, 12, 10, 10, 12, 3, 9, 4, 1, 0, 1, 4, 9, 3, 12, 10, 10, 12, 3, 9, 4, 1, 0, 1, 4, 9, 3, 12, 10, 10, 12, 3, 9, 4, 1, 0, 1, 4, 9, 3, 12, 10, 10, 12, 3, 9, 4, 1, 0, 1, 4, 9, 3, 12, 10, 10, 12, 3, 9, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,0,1). FORMULA G.f.: (x^12 +4*x^11 +9*x^10 +3*x^9 +12*x^8 +10*x^7 +10*x^6 +12*x^5 +3*x^4 +9*x^3 +4*x^2 +x)/(-x^13 +1). - Colin Barker, Aug 14 2012 a(n) = a(n-13). - G. C. Greubel, Mar 24 2016 MATHEMATICA Table[Mod[n^2, 13], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 21 2011 *) PROG (PARI) a(n)=n^2%13 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Cf. A070434, A070435. Sequence in context: A292340 A224953 A120869 * A259450 A219731 A217393 Adjacent sequences:  A070433 A070434 A070435 * A070437 A070438 A070439 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 October 17 16:51 EDT 2019. Contains 328120 sequences. (Running on oeis4.)