login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070445 a(n) = n^2 mod 23. 2
0, 1, 4, 9, 16, 2, 13, 3, 18, 12, 8, 6, 6, 8, 12, 18, 3, 13, 2, 16, 9, 4, 1, 0, 1, 4, 9, 16, 2, 13, 3, 18, 12, 8, 6, 6, 8, 12, 18, 3, 13, 2, 16, 9, 4, 1, 0, 1, 4, 9, 16, 2, 13, 3, 18, 12, 8, 6, 6, 8, 12, 18, 3, 13, 2, 16, 9, 4, 1, 0, 1, 4, 9, 16, 2, 13, 3, 18, 12, 8, 6, 6, 8, 12, 18, 3, 13, 2, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
From Robert Israel, Apr 23 2015: (Start)
a(n+23) = a(n).
G.f.: (1 +3*x +6*x^2 +10*x^3 -8*x^4 +21*x^5 -18*x^6 +36*x^7 -24*x^8 +32*x^9 -26*x^10 +32*x^11 -24*x^12 +36*x^13 -18*x^14 +21*x^15 -8*x^16 +10*x^17 +6*x^18 +3*x^19 +x^20)*x*(1+x)/(1-x^23). (End)
MATHEMATICA
Table[Mod[n^2, 23], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2011 *)
PROG
(Magma) [n^2 mod 23: n in [0..100]]; // Vincenzo Librandi, Apr 23 2015
(PARI) a(n)=n^2%23 \\ Charles R Greathouse IV, Apr 23 2015
CROSSREFS
Sequence in context: A007893 A070446 A258682 * A070444 A120866 A070443
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 08:27 EDT 2024. Contains 371698 sequences. (Running on oeis4.)