login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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
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