A070624 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A070624

a(n) = n^5 mod 41.

0, 1, 32, 38, 40, 9, 27, 38, 9, 9, 1, 3, 3, 38, 27, 14, 1, 27, 1, 27, 32, 9, 14, 40, 14, 40, 27, 14, 3, 38, 38, 40, 32, 32, 3, 14, 32, 1, 3, 9, 40, 0, 1, 32, 38, 40, 9, 27, 38, 9, 9, 1, 3, 3, 38, 27, 14, 1, 27, 1, 27, 32, 9, 14, 40, 14, 40, 27, 14, 3, 38, 38, 40, 32, 32, 3, 14, 32, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

Table of n, a(n) for n=0..78.

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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

FORMULA

a(n) = a(n-41). - Wesley Ivan Hurt, Dec 26 2023

MATHEMATICA

PowerMod[Range[0, 100], 5, 41] (* Wesley Ivan Hurt, Dec 26 2023 *)

PROG

(Sage) [power_mod(n, 5, 41)for n in range(0, 79)] # Zerinvary Lajos, Nov 04 2009

(PARI) a(n)=n^5%41 \\ Charles R Greathouse IV, Apr 06 2016

CROSSREFS

Sequence in context: A188827 A030094 A082591 * A345491 A178099 A039778

Adjacent sequences: A070621 A070622 A070623 * A070625 A070626 A070627

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 13 2002

STATUS

approved