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!)
A070487 a(n) = n^3 mod 25. 1
0, 1, 8, 2, 14, 0, 16, 18, 12, 4, 0, 6, 3, 22, 19, 0, 21, 13, 7, 9, 0, 11, 23, 17, 24, 0, 1, 8, 2, 14, 0, 16, 18, 12, 4, 0, 6, 3, 22, 19, 0, 21, 13, 7, 9, 0, 11, 23, 17, 24, 0, 1, 8, 2, 14, 0, 16, 18, 12, 4, 0, 6, 3, 22, 19, 0, 21, 13, 7, 9, 0, 11, 23, 17, 24, 0, 1, 8, 2, 14, 0, 16, 18, 12, 4 (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-25). - G. C. Greubel, Mar 30 2016

MATHEMATICA

Mod[Range[0, 100]^3, 25]  (* Harvey P. Dale, Mar 14 2011 *)

PROG

(Sage) [power_mod(n, 3, 25 )for n in range(0, 85)] # Zerinvary Lajos, Oct 29 2009

(PARI) a(n)=n^3%25 \\ Charles R Greathouse IV, Apr 06 2016

CROSSREFS

Sequence in context: A248298 A084495 A084499 * A167623 A040063 A196170

Adjacent sequences:  A070484 A070485 A070486 * A070488 A070489 A070490

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 24 04:42 EDT 2020. Contains 337317 sequences. (Running on oeis4.)