cp's OEIS Frontend

A384082 Consecutive states of the linear congruential pseudo-random number generator (61*s+323) mod 500 when started at s=1.

%I A384082 #20 May 28 2025 20:58:33
%S A384082 1,384,247,390,113,216,499,262,305,428,431,114,277,220,243,146,229,
%T A384082 292,135,58,361,344,307,50,373,76,459,322,465,188,291,74,337,380,3,6,
%U A384082 189,352,295,318,221,304,367,210,133,436,419,382,125,448,151,34,397,40
%N A384082 Consecutive states of the linear congruential pseudo-random number generator (61*s+323) mod 500 when started at s=1.
%C A384082 Periodic with period length 500.
%C A384082 Originally defined by Lamie in the form (61*s+2323) mod 500, even though 2323 > 500.
%D A384082 Edward L. Lamie, Pascal Programming, John Wiley and Sons, 1987 (see p. 150).
%H A384082 Sean A. Irvine, <a href="/A384082/b384082.txt">Table of n, a(n) for n = 1..500</a>
%H A384082 Stephen K. Park and Keith W. Miller, <a href="https://doi.org/10.1145/63039.63042">Random number generators: good ones are hard to find</a>, Communications of the ACM, Vol 31, 10 (1988), 192-201.
%H A384082 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>.
%H A384082 <a href="/index/Rec#order_500">Index entries for linear recurrences with constant coefficients</a>, order 500.
%F A384082 a(n) = (61*a(n-1) + 323) mod 500.
%p A384082 a:= proc(n) option remember; `if`(n<2, n,
%p A384082       irem(61*a(n-1)+323, 500))
%p A384082     end:
%p A384082 seq(a(n), n=1..54);  # _Alois P. Heinz_, May 21 2025
%t A384082 NestList[Mod[61*# + 323, 500] &, 1, 100] (* _Paolo Xausa_, May 19 2025 *)
%Y A384082 Cf. A096550-A096561 other pseudo-random number generators.
%K A384082 nonn,easy
%O A384082 1,2
%A A384082 _Sean A. Irvine_, May 18 2025