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”).
%I #20 Dec 19 2023 13:49:06
%S 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,
%T 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,
%U 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
%N a(n) = n mod 14.
%C Same as n^7 mod 14.
%C More generally, a(n) = n^(7^k) mod 14, for k >= 0. - _Altug Alkan_, Mar 25 2016
%H <a href="/index/Rec#order_14">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%t Table[Mod[n, 14], {n, 0, 120}] (* _Michael De Vlieger_, Mar 25 2016 *)
%o (Sage) [power_mod(n,7,14) for n in range(0, 93)] # _Zerinvary Lajos_, Oct 28 2009
%o (PARI) a(n) = n % 14; \\ _Joerg Arndt_, Mar 25 2016
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_, May 13 2002