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!)
A070696 a(n) = n mod 14. 2
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 0, 1, 2, 3, 4, 5, 6, 7, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Same as n^7 mod 14.
More generally, a(n) = n^(7^k) mod 14, for k >= 0. - Altug Alkan, Mar 25 2016
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
MATHEMATICA
Table[Mod[n, 14], {n, 0, 120}] (* Michael De Vlieger, Mar 25 2016 *)
PROG
(Sage) [power_mod(n, 7, 14) for n in range(0, 93)] # Zerinvary Lajos, Oct 28 2009
(PARI) a(n) = n % 14; \\ Joerg Arndt, Mar 25 2016
CROSSREFS
Sequence in context: A303219 A071523 A297244 * A053834 A297245 A043273
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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)