cp's OEIS Frontend

A385340 Consecutive states of the linear congruential pseudo-random number generator (1093*s + 18257) mod 86436 when started at s=1.

%I A385340 #9 Jul 06 2025 18:13:45
%S A385340 1,19350,77423,20752,53961,48278,60151,71940,78353,10,29187,24764,
%T A385340 30841,17430,53327,46804,4917,33506,77887,9288,57029,30598,11139,5708,
%U A385340 33709,40458,70055,6076,3753,57794,2383,29796,85349,40270,37443,59228,13897,81378,21767
%N A385340 Consecutive states of the linear congruential pseudo-random number generator (1093*s + 18257) mod 86436 when started at s=1.
%C A385340 Periodic with period 86436.
%C A385340 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385340 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 A385340 Sean A. Irvine, <a href="/A385340/b385340.txt">Table of n, a(n) for n = 1..10000</a>
%H A385340 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385340 <a href="/index/Rec#order_86436">Index entries for linear recurrences with constant coefficients</a>, order 86436.
%F A385340 a(n) = (1093 * a(n-1) + 18257) mod 86436.
%p A385340 a:= proc(n) option remember; `if`(n<2, n,
%p A385340       irem(1093*a(n-1)+18257, 86436))
%p A385340     end:
%p A385340 seq(a(n), n=1..44);  # after _Alois P. Heinz_
%t A385340 NestList[Mod[1093*# + 18257, 86435] &, 1, 50] (* after _Paolo Xausa_ *)
%Y A385340 Cf. A383126, A385338.
%K A385340 nonn,easy
%O A385340 1,2
%A A385340 _Sean A. Irvine_, Jun 25 2025