The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Index entries for linear recurrences with constant coefficients, 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).
FORMULA
a(n) = a(n-26). - G. C. Greubel, Mar 30 2016
MATHEMATICA
PowerMod[Range[0, 100], 3, 26] (* G. C. Greubel, Mar 30 2016 *)
PROG
(Sage) [power_mod(n, 3, 26 ) for n in range(0, 81)] # Zerinvary Lajos, Oct 30 2009
(PARI) a(n)=n^3%26 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A092702 A070475 A045771 * A349142 A322079 A124906
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
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 June 12 14:26 EDT 2024. Contains 373331 sequences. (Running on oeis4.)