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!)
A070651 a(n) = n^6 mod 28. 0
0, 1, 8, 1, 8, 1, 8, 21, 8, 1, 8, 1, 8, 1, 0, 1, 8, 1, 8, 1, 8, 21, 8, 1, 8, 1, 8, 1, 0, 1, 8, 1, 8, 1, 8, 21, 8, 1, 8, 1, 8, 1, 0, 1, 8, 1, 8, 1, 8, 21, 8, 1, 8, 1, 8, 1, 0, 1, 8, 1, 8, 1, 8, 21, 8, 1, 8, 1, 8, 1, 0, 1, 8, 1, 8, 1, 8, 21, 8, 1, 8, 1, 8, 1, 0, 1, 8, 1, 8, 1, 8, 21, 8, 1, 8, 1, 8, 1, 0, 1, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-14). - Wesley Ivan Hurt, Dec 26 2023
MATHEMATICA
PowerMod[Range[0, 100], 6, 28] (* Wesley Ivan Hurt, Dec 26 2023 *)
PROG
(Sage) [power_mod(n, 6, 28)for n in range(0, 101)] # Zerinvary Lajos, Nov 06 2009
(PARI) a(n)=n^6%28 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A021059 A010689 A070637 * A266528 A010519 A238214
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 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 23 11:04 EDT 2024. Contains 371905 sequences. (Running on oeis4.)