The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A070478 a(n) = n^3 mod 16. 1
0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
a(4k) = 0, k>=0, k being integer. - G. C. Greubel, Mar 30 2016
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, 1).
FORMULA
From G. C. Greubel, Mar 28 2016: (Start)
a(n) = a(n-16).
G.f.: (-x -8*x^2 -11*x^3 -13*x^5 -8*x^6 -7*x^7 -9*x^9 -8*x^10 -3*x^11 -5*x^13 -8*x^14 -15*x^15)/(-1 + x^16). (End)
MATHEMATICA
Table[Mod[n^3, 16], {n, 0, 100}] (* G. C. Greubel, Mar 28 2016 *)
PROG
(Sage) [power_mod(n, 3, 16) for n in range(0, 96)] # Zerinvary Lajos, Oct 28 2009
(Magma) [Modexp(n, 3, 16): n in [0..100]]; // Vincenzo Librandi, Mar 28 2016
(PARI) a(n)=n^3%16 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A002286 A256877 A222299 * A306527 A347306 A109596
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 June 13 22:21 EDT 2024. Contains 373391 sequences. (Running on oeis4.)