login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = n^2 mod 36.
2

%I #17 Dec 18 2023 12:54:37

%S 0,1,4,9,16,25,0,13,28,9,28,13,0,25,16,9,4,1,0,1,4,9,16,25,0,13,28,9,

%T 28,13,0,25,16,9,4,1,0,1,4,9,16,25,0,13,28,9,28,13,0,25,16,9,4,1,0,1,

%U 4,9,16,25,0,13,28,9,28,13,0,25,16,9,4,1,0,1,4,9,16,25,0,13,28,9,28,13,0

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

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

%H <a href="/index/Rec#order_18">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%F a(n) = a(n-18). - _G. C. Greubel_, Mar 25 2016

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

%t PowerMod[Range[0,90],2,36] (* _Harvey P. Dale_, Jan 02 2016 *)

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

%Y Cf. A070456, A070457.

%K nonn,easy

%O 0,3

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