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!)
A070613 a(n) = n^5 mod 29. 0
0, 1, 3, 11, 9, 22, 4, 16, 27, 5, 8, 14, 12, 6, 19, 10, 23, 17, 15, 21, 24, 2, 13, 25, 7, 20, 18, 26, 28, 0, 1, 3, 11, 9, 22, 4, 16, 27, 5, 8, 14, 12, 6, 19, 10, 23, 17, 15, 21, 24, 2, 13, 25, 7, 20, 18, 26, 28, 0, 1, 3, 11, 9, 22, 4, 16, 27, 5, 8, 14, 12, 6, 19, 10, 23, 17, 15, 21 (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, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-29). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 80], 5, 29] (* Harvey P. Dale, Dec 28 2011 *)
PROG
(Sage) [power_mod(n, 5, 29)for n in range(0, 78)] # Zerinvary Lajos, Nov 04 2009
(PARI) a(n)=n^5%29 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A330566 A361974 A205120 * A316884 A084409 A038229
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 April 18 11:17 EDT 2024. Contains 371779 sequences. (Running on oeis4.)