cp's OEIS Frontend

A385464 Consecutive internal states of the linear congruential pseudo-random number generator (9301*s + 49297) mod 233280 when started at 1.

%I A385464 #9 Jul 06 2025 19:23:42
%S A385464 1,58598,127215,79852,222509,178626,29563,210920,164697,179614,121031,
%T A385464 182628,160645,50042,96339,69856,95153,3030,4447,120284,233181,61618,
%U A385464 222635,184152,105289,32846,186423,232660,114677,103914,74371,98768,33825,194182,82319
%N A385464 Consecutive internal states of the linear congruential pseudo-random number generator (9301*s + 49297) mod 233280 when started at 1.
%C A385464 Periodic with period 233280.
%C A385464 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385464 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 A385464 Sean A. Irvine, <a href="/A385464/b385464.txt">Table of n, a(n) for n = 1..10000</a>
%H A385464 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385464 <a href="/index/Rec#order_233280">Index entries for linear recurrences with constant coefficients</a>, order 233280.
%F A385464 a(n) = (9301*a(n-1) + 49297) mod 233280.
%p A385464 a:= proc(n) option remember; `if`(n<2, n,
%p A385464       irem(9301*a(n-1)+49297, 233280))
%p A385464     end:
%p A385464 seq(a(n), n=1..45);  # after _Alois P. Heinz_
%t A385464 NestList[Mod[9301*# + 49297, 233280] &, 1, 50]
%Y A385464 Cf. A385360, A385463.
%K A385464 nonn,easy
%O A385464 1,2
%A A385464 _Sean A. Irvine_, Jun 29 2025