login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070437 a(n) = n^2 mod 14. 1

%I #31 Apr 06 2016 18:04:19

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

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

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

%N a(n) = n^2 mod 14.

%H G. C. Greubel, <a href="/A070437/b070437.txt">Table of n, a(n) for n = 0..1000</a>

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

%F G.f.: -x*(1 +4*x +9*x^2 +2*x^3 +11*x^4 +8*x^5 +7*x^6 +8*x^7 +11*x^8 +2*x^9 +9*x^10 +4*x^11 +x^12) / ((x-1)*(1+x^6+x^5+x^4+x^3+x^2+x)*(1+x)*(1-x+x^2-x^3+x^4-x^5+x^6)). - _R. J. Mathar_, Jul 27 2015

%F a(n) = a(n-14). - _G. C. Greubel_, Mar 24 2016

%t Table[Mod[n^2,14],{n,0,200}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 21 2011 *)

%t PowerMod[Range[0,100],2,14] (* _Harvey P. Dale_, Dec 02 2014 *)

%o (PARI) a(n)=n^2%14 \\ _Charles R Greathouse IV_, Apr 06 2016

%Y Cf. A070434, A070435, A070436.

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, May 12 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 16:16 EDT 2024. Contains 372387 sequences. (Running on oeis4.)