Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #15 Dec 18 2023 13:14:20
%S 0,1,4,9,16,25,36,1,16,33,4,25,0,25,4,33,16,1,36,25,16,9,4,1,0,1,4,9,
%T 16,25,36,1,16,33,4,25,0,25,4,33,16,1,36,25,16,9,4,1,0,1,4,9,16,25,36,
%U 1,16,33,4,25,0,25,4,33,16,1,36,25,16,9,4,1,0,1,4,9,16,25,36,1,16,33,4
%N a(n) = n^2 mod 48.
%H G. C. Greubel, <a href="/A070470/b070470.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_22">Index entries for linear recurrences with constant coefficients</a>, signature (-1, 0, 1, 1, 0, -1, -1, 0, 1, 1, 0, -1, -1, 0, 1, 1, 0, -1, -1, 0, 1, 1).
%F a(n) = a(n-24). - _G. C. Greubel_, Mar 26 2016
%t PowerMod[Range[0, 100], 2, 48] (* _G. C. Greubel_, Mar 26 2016 *)
%o (Magma) [Modexp(n, 2, 48 ): n in [0..100]]; // _Vincenzo Librandi_, Mar 27 2016
%o (PARI) a(n)=n^2%48 \\ _Charles R Greathouse IV_, Apr 06 2016
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_, May 12 2002