cp's OEIS Frontend

A385461 Consecutive internal states of the linear congruential pseudo-random number generator (8121*s + 28411) mod 134456 when started at 1.

%I A385461 #9 Jul 06 2025 18:19:30
%S A385461 1,36532,94847,116930,88669,97480,121019,84806,54305,23636,107655,
%T A385461 61754,11765,108216,46131,63846,59441,51732,103439,109898,125597,
%U A385461 18432,65155,67806,83617,79268,122967,38706,1709,58232,48731,68854,123697,50972,116455,130418
%N A385461 Consecutive internal states of the linear congruential pseudo-random number generator (8121*s + 28411) mod 134456 when started at 1.
%C A385461 Periodic with period 134456.
%C A385461 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385461 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 A385461 Sean A. Irvine, <a href="/A385461/b385461.txt">Table of n, a(n) for n = 1..10000</a>
%H A385461 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385461 <a href="/index/Rec#order_134456">Index entries for linear recurrences with constant coefficients</a>, order 134456.
%F A385461 a(n) = (8121*a(n-1) + 28411) mod 134456.
%p A385461 a:= proc(n) option remember; `if`(n<2, n,
%p A385461       irem(8121*a(n-1)+28411, 134456))
%p A385461     end:
%p A385461 seq(a(n), n=1..45);  # after _Alois P. Heinz_
%t A385461 NestList[Mod[8121*# + 28411, 134456] &, 1, 50]
%Y A385461 Cf. A383126, A383127, A385459.
%K A385461 nonn,easy
%O A385461 1,2
%A A385461 _Sean A. Irvine_, Jun 29 2025