cp's OEIS Frontend

A385460 Consecutive internal states of the linear congruential pseudo-random number generator (1366*s + 150889) mod 714025 when started at 1.

%I A385460 #9 Jul 06 2025 18:18:26
%S A385460 1,152255,349944,491668,585877,36846,500775,173589,217163,475172,
%T A385460 187116,130395,478234,85658,59617,188861,371990,617454,329528,450387,
%U A385460 604006,524210,54674,576973,12407,676276,709580,505244,566043,76552,473271,446450,224239,144638
%N A385460 Consecutive internal states of the linear congruential pseudo-random number generator (1366*s + 150889) mod 714025 when started at 1.
%C A385460 Periodic with period 714025.
%C A385460 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385460 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 A385460 Sean A. Irvine, <a href="/A385460/b385460.txt">Table of n, a(n) for n = 1..10000</a>
%H A385460 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385460 <a href="/index/Rec#order_714025">Index entries for linear recurrences with constant coefficients</a>, order 714025.
%F A385460 a(n) = (1366*a(n-1) + 150889) mod 714025.
%p A385460 a:= proc(n) option remember; `if`(n<2, n,
%p A385460       irem(1366*a(n-1)+150889, 714025))
%p A385460     end:
%p A385460 seq(a(n), n=1..45);  # after _Alois P. Heinz_
%t A385460 NestList[Mod[1366*# + 150889, 714025] &, 1, 50]
%Y A385460 Cf. A385358, A385360.
%K A385460 nonn,easy
%O A385460 1,2
%A A385460 _Sean A. Irvine_, Jun 29 2025