|
%I #28 Nov 14 2023 08:30:37
%S 0,0,1,0,0,4,6,0,1,0,10,4,12,6,10,8,14,10,12,0,13,10,11,16,0,12,1,20,
%T 14,10,8,8,10,14,20,28,1,12,25,0,16,34,11,32,10,34,13,40,20,0,31,12,
%U 46,28,10,48,31,14,56,40,24,8,55,40,25,10,62,48,34,20,6,64,51,38,25,12,76
%N a(n) = 1000 mod n.
%H David A. Corneth, <a href="/A324472/b324472.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F a(n) = 1000 for n >= 1001.
%F a(n) = 0 <=> n in { A018767 }.
%F a(n) = 1 <=> n > 1 and n in { A018766 }.
%e a(98) = 1000 mod 98 = 20 as 1000 = 98 * 10 + 20. - _David A. Corneth_, Mar 07 2019
%t Mod[1000,Range[100]] (* _Paolo Xausa_, Nov 14 2023 *)
%o (PARI) a(n) = 1000 % n \\ _David A. Corneth_, Mar 07 2019
%Y Cf. A018766, A018767, A048158, A051127, A090976, A324471.
%K nonn,easy
%O 1,6
%A _N. J. A. Sloane_, Mar 07 2019, following a suggestion from _Charles Kusniec_.
|
