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!)
A070551 n^4 mod 23. 1
0, 1, 16, 12, 3, 4, 8, 9, 2, 6, 18, 13, 13, 18, 6, 2, 9, 8, 4, 3, 12, 16, 1, 0, 1, 16, 12, 3, 4, 8, 9, 2, 6, 18, 13, 13, 18, 6, 2, 9, 8, 4, 3, 12, 16, 1, 0, 1, 16, 12, 3, 4, 8, 9, 2, 6, 18, 13, 13, 18, 6, 2, 9, 8, 4, 3, 12, 16, 1, 0, 1, 16, 12, 3, 4, 8, 9, 2, 6, 18, 13, 13, 18, 6, 2, 9, 8, 4, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Equivalently: n^(22*m + 4) mod 23. - G. C. Greubel, Apr 06 2016
LINKS
FORMULA
From G. C. Greubel, Apr 06 2016: (Start)
a(23*n) = 0.
a(n+23) = a(n). (End)
MATHEMATICA
PowerMod[Range[0, 90], 4, 23] (* Harvey P. Dale, Feb 25 2015 *)
PROG
(Sage) [power_mod(n, 4, 23)for n in range(0, 89)] # Zerinvary Lajos, Oct 31 2009
(PARI) a(n)=n^4%23 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A028695 A008665 A076823 * A028493 A291426 A299524
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 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 May 30 07:51 EDT 2023. Contains 363050 sequences. (Running on oeis4.)