cp's OEIS Frontend

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

%I A385002 #20 Jun 20 2025 08:36:03
%S A385002 1,1874,3327,2785,6548,5166,4939,4292,1650,3313,7706,5379,2632,5765,
%T A385002 5328,7621,3194,6222,7255,4718,4911,6259,7187,6120,1483,7451,6699,
%U A385002 5527,2360,3498,7366,4514,1242,3850,2888,4656,7579,2207,2715,7528,7196,144,547,6830
%N A385002 Consecutive states of the linear congruential pseudo-random number generator (211*s + 1663) mod 7875 when started at s=1.
%C A385002 Periodic with period 7875.
%C A385002 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385002 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 A385002 Sean A. Irvine, <a href="/A385002/b385002.txt">Table of n, a(n) for n = 1..7875</a>
%H A385002 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 A385002 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385002 <a href="/index/Rec#order_7875">Index entries for linear recurrences with constant coefficients</a>, order 7875.
%F A385002 a(n) = (211 * a(n-1) + 1663) mod 7875.
%p A385002 a:= proc(n) option remember; `if`(n<2, n,
%p A385002       irem(211*a(n-1)+1663, 7875))
%p A385002     end:
%p A385002 seq(a(n), n=1..44);  # _Alois P. Heinz_, Jun 14 2025
%t A385002 NestList[Mod[211*# + 1663, 7875] &, 1, 50] (* _Paolo Xausa_, Jun 17 2025 *)
%Y A385002 Cf. A384113, A384971, A385003.
%K A385002 nonn,look,easy
%O A385002 1,2
%A A385002 _Sean A. Irvine_, Jun 14 2025