A070696 a(n) = n mod 14.

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

Author

N. J. A. Sloane, May 13 2002

Keywords

• nonn
• easy

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

Programs

Mathematica

Table[Mod[n, 14], {n, 0, 120}] (* Michael De Vlieger, Mar 25 2016 *)

PARI

a(n) = n % 14; \\ Joerg Arndt, Mar 25 2016

Sage

[power_mod(n,7,14) for n in range(0, 93)] # Zerinvary Lajos, Oct 28 2009