cp's OEIS Frontend

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

%I A385465 #9 Jul 06 2025 19:23:16
%S A385465 1,154985,201224,379543,326592,502896,50780,364494,92038,133337,70116,
%T A385465 307975,648339,288458,677507,518411,51995,342959,423778,150802,204256,
%U A385465 660190,276454,62823,424897,450076,49635,672749,308318,625217,546071,531405,437569,230763
%N A385465 Consecutive internal states of the linear congruential pseudo-random number generator (4096*s + 150889) mod 714025 when started at 1.
%C A385465 Periodic with period 714025.
%C A385465 Described in Numerical Recipes as a "quick and dirty" generator.
%D A385465 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 A385465 Sean A. Irvine, <a href="/A385465/b385465.txt">Table of n, a(n) for n = 1..10000</a>
%H A385465 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A385465 <a href="/index/Rec#order_714025">Index entries for linear recurrences with constant coefficients</a>, order 714025.
%F A385465 a(n) = (4096*a(n-1) + 150889) mod 714025.
%p A385465 a:= proc(n) option remember; `if`(n<2, n,
%p A385465       irem(4096*a(n-1)+150889, 714025))
%p A385465     end:
%p A385465 seq(a(n), n=1..45);  # after _Alois P. Heinz_
%t A385465 NestList[Mod[4096*# + 150889, 714025] &, 1, 50]
%Y A385465 Cf. A385358, A385460.
%K A385465 nonn,easy
%O A385465 1,2
%A A385465 _Sean A. Irvine_, Jun 29 2025