|
%I #21 Dec 18 2023 15:12:42
%S 0,1,8,27,16,29,24,7,32,9,40,35,0,37,8,15,16,17,24,43,32,45,40,23,0,
%T 25,8,3,16,5,24,31,32,33,40,11,0,13,8,39,16,41,24,19,32,21,40,47,0,1,
%U 8,27,16,29,24,7,32,9,40,35,0,37,8,15,16,17,24,43,32,45,40,23,0,25,8,3,16,5
%N a(n) = n^3 mod 48.
%H G. C. Greubel, <a href="/A070510/b070510.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_48">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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F From _G. C. Greubel_, Apr 01 2016: (Start)
%F a(n) = a(n-48).
%F a(12*m) = 0.
%F a(2*n) = 8*A010875(n). (End)
%t PowerMod[Range[0,80],3,48] (* _Harvey P. Dale_, Apr 03 2013 *)
%o (Sage) [power_mod(n,3,48) for n in range(0, 78)] # _Zerinvary Lajos_, Oct 30 2009
%o (Magma) [Modexp(n, 3, 48): n in [0..80]]; // _Bruno Berselli_, Mar 31 2016
%o (PARI) a(n)=n^3%48 \\ _Charles R Greathouse IV_, Apr 06 2016
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_, May 12 2002
|
