cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A167420 2^n mod 14.

This page as a plain text file.
%I A167420 #11 Dec 07 2019 12:18:26
%S A167420 1,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,
%T A167420 2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,
%U A167420 4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8,2,4,8
%N A167420 2^n mod 14.
%H A167420 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1).
%F A167420 G.f.: 1 + -2*x*(1+2*x+4*x^2) / ( (x-1)*(1+x+x^2) ). - _R. J. Mathar_, Jun 18 2019
%t A167420 PowerMod[2,Range[0,100],14] (* _Harvey P. Dale_, Jul 25 2011 *)
%o A167420 (Sage) [power_mod(2,n,14)for n in range(0,100)] #
%o A167420 (PARI) a(n)=lift(Mod(2,14)^n) \\ _Charles R Greathouse IV_, Mar 22 2016
%K A167420 nonn,easy
%O A167420 0,2
%A A167420 _Zerinvary Lajos_, Nov 03 2009