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!)
A070491 a(n) = n^3 mod 29. 1
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, 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, 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 (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-29). - G. C. Greubel, Mar 30 2016

MATHEMATICA

Table[Mod[n^3, 29], {n, 0, 100}] (* Vincenzo Librandi, Jun 19 2014 *)

PROG

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

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

CROSSREFS

Cf. A008960.

Sequence in context: A070711 A282462 A056555 * A070490 A088378 A005064

Adjacent sequences:  A070488 A070489 A070490 * A070492 A070493 A070494

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 July 8 08:08 EDT 2020. Contains 335520 sequences. (Running on oeis4.)