login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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

G. C. Greubel, Table of n, a(n) for n = 0..1000

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 * A322079 A124906 A298143

Adjacent sequences:  A070485 A070486 A070487 * A070489 A070490 A070491

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 08:38 EDT 2020. Contains 337268 sequences. (Running on oeis4.)