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

%I #16 Dec 18 2023 14:53:17

%S 0,1,8,1,12,21,8,5,18,1,12,5,12,13,14,21,14,25,8,21,18,5,14,25,18,25,

%T 0,1,8,1,12,21,8,5,18,1,12,5,12,13,14,21,14,25,8,21,18,5,14,25,18,25,

%U 0,1,8,1,12,21,8,5,18,1,12,5,12,13,14,21,14,25,8,21,18,5,14,25,18,25,0,1,8

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

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

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

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

%t PowerMod[Range[0, 100], 3, 26] (* _G. C. Greubel_, Mar 30 2016 *)

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

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

%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 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)