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

%I #20 Jun 20 2025 08:36:03

%S 1,1874,3327,2785,6548,5166,4939,4292,1650,3313,7706,5379,2632,5765,

%T 5328,7621,3194,6222,7255,4718,4911,6259,7187,6120,1483,7451,6699,

%U 5527,2360,3498,7366,4514,1242,3850,2888,4656,7579,2207,2715,7528,7196,144,547,6830

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

%C Periodic with period 7875.

%C Described in Numerical Recipes as a "quick and dirty" generator.

%D 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 Sean A. Irvine, <a href="/A385002/b385002.txt">Table of n, a(n) for n = 1..7875</a>

%H 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 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>

%H <a href="/index/Rec#order_7875">Index entries for linear recurrences with constant coefficients</a>, order 7875.

%F a(n) = (211 * a(n-1) + 1663) mod 7875.

%p a:= proc(n) option remember; `if`(n<2, n,

%p irem(211*a(n-1)+1663, 7875))

%p end:

%p seq(a(n), n=1..44); # _Alois P. Heinz_, Jun 14 2025

%t NestList[Mod[211*# + 1663, 7875] &, 1, 50] (* _Paolo Xausa_, Jun 17 2025 *)

%Y Cf. A384113, A384971, A385003.

%K nonn,look,easy

%O 1,2

%A _Sean A. Irvine_, Jun 14 2025