cp's OEIS Frontend

A384608 Consecutive states of the linear congruential pseudo-random number generator (129*s+27098671125) mod 2^35 when started at s=1.

%I A384608 #16 Jun 12 2025 05:56:53
%S A384608 1,27098671254,18133949355,29915928896,3603063125,10857477098,
%T A384608 18963943679,33905981588,2923784873,26309797694,19448475219,
%U A384608 27691073512,25834363901,26836992658,18737148839,4649447228,8402072913,11454449126,27253858555,3793372816,1047688869
%N A384608 Consecutive states of the linear congruential pseudo-random number generator (129*s+27098671125) mod 2^35 when started at s=1.
%C A384608 Periodic with period 2^35.
%C A384608 The first set of numbers on p. 156 of Hirsh is reproduced by s/2^35 starting with s=4818528277.
%D A384608 Seymour C. Hirsh, BASIC Programming Self-Taught, Reston Pub Co, Reston, VA, 1980 (see p. 156).
%D A384608 Donald E. Knuth, The Art of Computer Programming, Vol 2: Seminumerical Algorithms (3rd ed.), Addison-Wesley, 1998 (see p. 106).
%H A384608 Sean A. Irvine, <a href="/A384608/b384608.txt">Table of n, a(n) for n = 1..10000</a>
%H A384608 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>.
%F A384608 a(n) = (129*a(n-1) + 27098671125) mod 2^35.
%p A384608 a:= proc(n) option remember; `if`(n<2, n,
%p A384608       irem(129*a(n-1)+27098671125, 2^35))
%p A384608     end:
%p A384608 seq(a(n), n=1..21);  # _Alois P. Heinz_, Jun 04 2025
%t A384608 NestList[Mod[129*# + 27098671125, 2^35] &, 1, 30] (* _Paolo Xausa_, Jun 12 2025 *)
%Y A384608 Cf. A096550-A096561 for other pseudo-random number generators.
%Y A384608 Cf. A384387, A384565.
%K A384608 nonn,easy
%O A384608 1,2
%A A384608 _Sean A. Irvine_, Jun 04 2025