cp's OEIS Frontend

A385279 Consecutive states of the linear congruential pseudo-random number generator (625*s + 6571) mod 31104 when started at s=1.

%I A385279 #9 Jun 24 2025 09:59:10
%S A385279 1,7196,25095,14530,5453,24360,21715,17102,26649,21556,11039,858,
%T A385279 14053,18368,9195,30310,7985,20556,8119,10994,3837,9688,27395,21246,
%U A385279 3913,26084,10575,21898,7061,2928,1435,1430,29409,4732,9191,27810,685,30344,29235,20398
%N A385279 Consecutive states of the linear congruential pseudo-random number generator (625*s + 6571) mod 31104 when started at s=1.
%C A385279 Periodic with period 31104.
%C A385279 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385279 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 A385279 Sean A. Irvine, <a href="/A385279/b385279.txt">Table of n, a(n) for n = 1..10000</a>
%H A385279 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385279 <a href="/index/Rec#order_31104">Index entries for linear recurrences with constant coefficients</a>, order 31104.
%F A385279 a(n) = (625 * a(n-1) + 6571) mod 31104.
%p A385279 a:= proc(n) option remember; `if`(n<2, n,
%p A385279       irem(625*a(n-1)+6571, 31104))
%p A385279     end:
%p A385279 seq(a(n), n=1..44);  # after _Alois P. Heinz_
%t A385279 NestList[Mod[625*# + 6571, 31104] &, 1, 50] (* after _Paolo Xausa_ *)
%Y A385279 Cf. A385036, A385039.
%K A385279 nonn,easy
%O A385279 1,2
%A A385279 _Sean A. Irvine_, Jun 23 2025