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!)
A070481 a(n) = n^3 mod 19. 1

%I #30 Dec 18 2023 14:46:43

%S 0,1,8,8,7,11,7,1,18,7,12,1,18,12,8,12,11,11,18,0,1,8,8,7,11,7,1,18,7,

%T 12,1,18,12,8,12,11,11,18,0,1,8,8,7,11,7,1,18,7,12,1,18,12,8,12,11,11,

%U 18,0,1,8,8,7,11,7,1,18,7,12,1,18,12,8,12,11,11,18,0,1,8,8,7,11,7,1,18

%N a(n) = n^3 mod 19.

%H G. C. Greubel, <a href="/A070481/b070481.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_19">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%F From _G. C. Greubel_, Mar 28 2016: (Start)

%F a(n) = a(n-19).

%F G.f.: (-x -8*x^2 -8*x^3 -7*x^4 -11*x^5 -7*x^6 -x^7 -18*x^8 -7*x^9 - 12*x^10 -x^11 -18*x^12 -12*x^13 -8*x^14 -12*x^15 -11*x^16 -11*x^17 - 18*x^18)/(-1 + x^19). (End)

%t Table[Mod[n^3, 19], {n, 0, 100}] (* _Vincenzo Librandi_, Jun 19 2014 *)

%t PowerMod[Range[0,90],3,19] (* _Harvey P. Dale_, Feb 25 2015 *)

%o (Sage) [power_mod(n,3,19 )for n in range(0, 85)] # _Zerinvary Lajos_, Oct 29 2009

%o (Magma) [Modexp(n,3,19): n in [0..100]]; // _Vincenzo Librandi_, Mar 28 2016

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

%Y Cf. A008960.

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, May 12 2002

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 23 08:19 EDT 2024. Contains 371905 sequences. (Running on oeis4.)