This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070434 a(n) = n^2 mod 11. 7

%I

%S 0,1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,

%T 1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1,

%U 4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1,4,9,5,3,3,5,9,4,1,0,1

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

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

%F From _R. J. Mathar_, Apr 20 2010: (Start)

%F a(n) = a(n-11).

%F G.f.: ( -x*(1+x)*(x^8+3*x^7+6*x^6-x^5+4*x^4-x^3+6*x^2+3*x+1) ) / ( (x-1)*(1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9+x^10) ). (End)

%F a(n) = A010880(n^2). - _Michel Marcus_, Mar 24 2016

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

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

%Y Cf. A010880, A070430, A070431, A070432.

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 21 11:38 EDT 2019. Contains 328296 sequences. (Running on oeis4.)