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

%I #24 Dec 18 2023 14:55:55

%S 0,1,8,27,6,9,13,24,19,4,14,26,17,22,18,11,7,12,3,15,25,10,5,16,20,23,

%T 2,21,28,0,1,8,27,6,9,13,24,19,4,14,26,17,22,18,11,7,12,3,15,25,10,5,

%U 16,20,23,2,21,28,0,1,8,27,6,9,13,24,19,4,14,26,17,22,18,11,7,12,3,15

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

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

%H <a href="/index/Rec#order_29">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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%F a(n) = a(n-29). - _G. C. Greubel_, Mar 30 2016

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

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

%o (PARI) a(n)=n^3%29 \\ _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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)