cp's OEIS Frontend

A385459 Consecutive internal states of the linear congruential pseudo-random number generator (3877*s + 29573) mod 139968 when started at 1.

%I A385459 #9 Jul 06 2025 18:21:11
%S A385459 1,33450,104855,85336,132861,49430,53491,121572,91961,63874,65679,
%T A385459 65264,135925,31278,82091,9148,84465,115226,122887,11400,137453,76678,
%U A385459 18147,121556,29929,30834,40319,2080,115557,6494,12571,58476,132833,80842,65655,112184
%N A385459 Consecutive internal states of the linear congruential pseudo-random number generator (3877*s + 29573) mod 139968 when started at 1.
%C A385459 Periodic with period 139968.
%C A385459 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385459 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 A385459 Sean A. Irvine, <a href="/A385459/b385459.txt">Table of n, a(n) for n = 1..10000</a>
%H A385459 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385459 <a href="/index/Rec#order_139968">Index entries for linear recurrences with constant coefficients</a>, order 139968.
%F A385459 a(n) = (3877*a(n-1) + 29573) mod 139968.
%p A385459 a:= proc(n) option remember; `if`(n<2, n,
%p A385459       irem(3877*a(n-1)+29573, 139968))
%p A385459     end:
%p A385459 seq(a(n), n=1..45);  # after _Alois P. Heinz_
%t A385459 NestList[Mod[3877*# + 29573, 139968] &, 1, 50]
%Y A385459 Cf. A383127, A385365.
%K A385459 nonn,easy
%O A385459 1,2
%A A385459 _Sean A. Irvine_, Jun 29 2025