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!)
A167628 n^11 mod 13. 1
0, 1, 7, 9, 10, 8, 11, 2, 5, 3, 4, 6, 12, 0, 1, 7, 9, 10, 8, 11, 2, 5, 3, 4, 6, 12, 0, 1, 7, 9, 10, 8, 11, 2, 5, 3, 4, 6, 12, 0, 1, 7, 9, 10, 8, 11, 2, 5, 3, 4, 6, 12, 0, 1, 7, 9, 10, 8, 11, 2, 5, 3, 4, 6, 12, 0, 1, 7, 9, 10, 8, 11, 2, 5, 3, 4, 6, 12, 0, 1, 7, 9, 10, 8, 11, 2, 5, 3, 4, 6, 12, 0, 1, 7, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Equivalently: n^(12*m+11) (mod 13). - G. C. Greubel, Jun 17 2016
LINKS
FORMULA
a(n+13) = a(n). - G. C. Greubel, Jun 17 2016
MATHEMATICA
PowerMod[Range[0, 100], 11, 13] (* Harvey P. Dale, Oct 31 2011 *)
PROG
(Sage) [power_mod(n, 11, 13) for n in range(0, 95)]
(PARI) a(n)=n^11%13 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A111204 A000510 A262310 * A112954 A031952 A043617
KEYWORD
nonn,easy
AUTHOR
Zerinvary Lajos, Nov 07 2009
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 July 23 11:07 EDT 2024. Contains 374549 sequences. (Running on oeis4.)