cp's OEIS Frontend

A385339 Consecutive states of the linear congruential pseudo-random number generator (1255*s + 6173) mod 29282 when started at s=1.

%I A385339 #6 Jun 25 2025 22:50:05
%S A385339 1,7428,16637,7542,13297,3168,28943,19958,17353,27662,22813,27974,
%T A385339 4425,25250,11799,26508,9361,12146,22763,23788,21755,17874,8031,12070,
%U A385339 15229,26704,21085,26202,5997,6934,11589,26496,23583,28018,1081,15856,22975,26310,24409
%N A385339 Consecutive states of the linear congruential pseudo-random number generator (1255*s + 6173) mod 29282 when started at s=1.
%C A385339 Periodic with period 29282.
%C A385339 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385339 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 A385339 Sean A. Irvine, <a href="/A385339/b385339.txt">Table of n, a(n) for n = 1..10000</a>
%H A385339 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385339 <a href="/index/Rec#order_29282">Index entries for linear recurrences with constant coefficients</a>, order 29282.
%F A385339 a(n) = (1255 * a(n-1) + 6173) mod 29282.
%p A385339 a:= proc(n) option remember; `if`(n<2, n,
%p A385339       irem(1255*a(n-1)+6173, 29282))
%p A385339     end:
%p A385339 seq(a(n), n=1..44);  # after _Alois P. Heinz_
%t A385339 NestList[Mod[1255*# + 6173, 29282] &, 1, 50] (* after _Paolo Xausa_ *)
%Y A385339 Cf. A385036, A385078, A385279.
%K A385339 nonn,easy
%O A385339 1,2
%A A385339 _Sean A. Irvine_, Jun 25 2025