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!)
A070490 a(n) = n^3 mod 28. 2
0, 1, 8, 27, 8, 13, 20, 7, 8, 1, 20, 15, 20, 13, 0, 15, 8, 13, 8, 27, 20, 21, 8, 15, 20, 1, 20, 27, 0, 1, 8, 27, 8, 13, 20, 7, 8, 1, 20, 15, 20, 13, 0, 15, 8, 13, 8, 27, 20, 21, 8, 15, 20, 1, 20, 27, 0, 1, 8, 27, 8, 13, 20, 7, 8, 1, 20, 15, 20, 13, 0, 15, 8, 13, 8, 27, 20, 21, 8, 15, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(n) repeats after 28 terms. - Vincenzo Librandi, Oct 03 2015

a(14k) = 0. - Altug Alkan, Oct 03 2015

LINKS

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

MATHEMATICA

Table[PowerMod[n, 3, 28], {n, 0, 100}] (* Vincenzo Librandi, Oct 03 2015 *)

PROG

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

(PARI) vector(100, n, (n-1)^3 % 28); \\ Altug Alkan, Oct 03 2015

CROSSREFS

Cf. A000578, A070489.

Sequence in context: A282462 A056555 A070491 * A088378 A005064 A056551

Adjacent sequences:  A070487 A070488 A070489 * A070491 A070492 A070493

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 00:40 EDT 2020. Contains 335502 sequences. (Running on oeis4.)