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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A167628 n^11 mod 13. 1

%I #17 Dec 07 2019 12:18:26

%S 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,

%T 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,

%U 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

%N n^11 mod 13.

%C Equivalently: n^(12*m+11) (mod 13). - _G. C. Greubel_, Jun 17 2016

%H Vincenzo Librandi, <a href="/A167628/b167628.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n+13) = a(n). - _G. C. Greubel_, Jun 17 2016

%t PowerMod[Range[0,100],11,13] (* _Harvey P. Dale_, Oct 31 2011 *)

%o (Sage) [power_mod(n,11,13) for n in range(0, 95)]

%o (PARI) a(n)=n^11%13 \\ _Charles R Greathouse IV_, Apr 06 2016

%K nonn,easy

%O 0,3

%A _Zerinvary Lajos_, Nov 07 2009

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.

Last modified August 7 20:39 EDT 2024. Contains 375017 sequences. (Running on oeis4.)