cp's OEIS Frontend

A383809 Consecutive states of a linear congruential pseudo-random number generator for Lisp 1985 when started at 1.

%I A383809 #31 May 26 2025 06:33:11
%S A383809 1,17,38,144,189,201,154,108,79,88,241,81,122,66,118,249,217,175,214,
%T A383809 124,100,194,35,93,75,20,89,7,119,15,4,68,152,74,3,51,114,181,65,101,
%U A383809 211,73,237,13,221,243,115,198,103,245,149,23,140,121,49,80,105,28
%N A383809 Consecutive states of a linear congruential pseudo-random number generator for Lisp 1985 when started at 1.
%C A383809 An example of a terrible random number generator.
%C A383809 Periodic with period 125 (well below the modulus of 251).
%H A383809 Sean A. Irvine, <a href="/A383809/b383809.txt">Table of n, a(n) for n = 1..125</a>
%H A383809 Richard P. Gabriel, <a href="https://doi.org/10.7551/mitpress/5298.001.0001">Performance and Evaluation of Lisp Systems</a>, MIT, 1985 (see p. 140).
%H A383809 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 A383809 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A383809 <a href="/index/Rec#order_125">Index entries for linear recurrences with constant coefficients</a>, order 125.
%F A383809 a(n) = 17 * a(n-1) mod 251.
%p A383809 a:= proc(n) option remember; `if`(n<2, n,
%p A383809       irem(17*a(n-1), 251))
%p A383809     end:
%p A383809 seq(a(n), n=1..58);  # _Alois P. Heinz_, May 21 2025
%t A383809 NestList[Mod[17*#, 251] &, 1, 100] (* _Paolo Xausa_, May 21 2025 *)
%Y A383809 Cf. A001026.
%Y A383809 Cf. A096550-A096561 other pseudo-random number generators.
%K A383809 nonn,easy
%O A383809 1,2
%A A383809 _Sean A. Irvine_, May 17 2025