A070532 a(n) = n^4 mod 14.

0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2, 1, 0, 1, 2, 11, 4, 9, 8, 7, 8, 9, 4, 11, 2

Offset: 0

Author

N. J. A. Sloane, May 13 2002

Keywords

• nonn
• easy

Comments

Equivalently: n^(6*m + 4) mod 14. - G. C. Greubel, Apr 01 2016

Links

• G. C. Greubel, Table of n, a(n) for n = 0..1000
• Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

Crossrefs

Cf. A070512.

Programs

Magma

[Modexp(n, 4, 14): n in [0..100]]; // Vincenzo Librandi, Apr 02 2016

Mathematica

PowerMod[Range[0, 100], 4, 14] (* G. C. Greubel, Apr 01 2016 *)

PARI

a(n)=n^4%14 \\ Charles R Greathouse IV, Apr 06 2016

Sage

[power_mod(n,4,14)for n in range(0, 97)] # Zerinvary Lajos, Oct 31 2009

Formula

From G. C. Greubel, Apr 01 2016: (Start)

a(n+14) = a(n).

a(14*m) = 0.

a(2*n) = 2*A070512(n).

G.f.: (x +2*x^2 +11*x^3 +4*x^4 +9*x^5 +8*x^6 +7*x^7 +8*x^8 +9*x^9 +4*x^10 +11*x^11 +2*x^12 +x^13)/(1 - x^14). (End)