cp's OEIS Frontend

A385003 Consecutive states of the linear congruential pseudo-random number generator (421*s + 1663) mod 7875 when started at s=1.

%I A385003 #17 Jul 06 2025 18:25:48
%S A385003 1,2084,4902,2155,3293,2016,7774,6392,7320,4258,6656,339,2632,7235,
%T A385003 7848,6046,3404,1497,1900,6188,186,1219,2987,7065,7153,4826,1659,7102,
%U A385003 6980,2868,4216,4724,5967,1645,1208,6231,2539,7457,6810,2173,2996,2979,3697,6725
%N A385003 Consecutive states of the linear congruential pseudo-random number generator (421*s + 1663) mod 7875 when started at s=1.
%C A385003 Periodic with period 7875.
%C A385003 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385003 William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery, Numerical Recipes in C (2nd ed), Cambridge University Press, 1999 (see p. 285).
%H A385003 Sean A. Irvine, <a href="/A385003/b385003.txt">Table of n, a(n) for n = 1..7875</a>
%H A385003 W. E. Sharp and Carter Bays, <a href="https://doi.org/10.1016/0098-3004(92)90060-5">A review of portable random number generators</a>, Computers and Geosciences, 18, 1 (1982), 79-87.
%H A385003 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385003 <a href="/index/Rec#order_7875">Index entries for linear recurrences with constant coefficients</a>, order 7875.
%F A385003 a(n) = (421 * a(n-1) + 1663) mod 7875.
%p A385003 a:= proc(n) option remember; `if`(n<2, n,
%p A385003       irem(421*a(n-1)+1663, 7875))
%p A385003     end:
%p A385003 seq(a(n), n=1..44);  # _Alois P. Heinz_, Jun 14 2025
%t A385003 NestList[Mod[421*# + 1663, 7875] &, 1, 50] (* _Paolo Xausa_, Jun 17 2025 *)
%Y A385003 Cf. A384113, A384971, A385002.
%K A385003 nonn,easy,look
%O A385003 1,2
%A A385003 _Sean A. Irvine_, Jun 14 2025