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!)
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
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, 0, 0, 1).
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
Sequence in context: A282462 A056555 A070491 * A088378 A005064 A056551
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 April 25 13:33 EDT 2024. Contains 371971 sequences. (Running on oeis4.)