login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070593 a(n) = n^5 mod 7. 1
0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4, 5, 2, 3, 6, 0, 1, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Equivalently n^11 mod 7. - Zerinvary Lajos, Nov 07 2009

LINKS

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

Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,1).

MATHEMATICA

Table[If[Mod[n, 7] == 0, 0, ModularInverse[n, 7]], {n, 0, 100}] (* Jean-Fran├žois Alcover, May 03 2017 *)

PROG

(Sage) [power_mod(n, 5, 7)for n in range(0, 101)] # Zerinvary Lajos, Nov 07 2009

(Sage) [power_mod(n, 11, 7)for n in range(0, 101)] # Zerinvary Lajos, Nov 07 2009

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

CROSSREFS

Sequence in context: A329957 A074459 A155793 * A070599 A057301 A213171

Adjacent sequences:  A070590 A070591 A070592 * A070594 A070595 A070596

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 1 17:45 EDT 2020. Contains 337444 sequences. (Running on oeis4.)