cp's OEIS Frontend

A384565 Consecutive states of the linear congruential pseudo-random number generator 5*s mod 2^35 when started at s=1.

%I A384565 #45 Jun 19 2025 13:30:29
%S A384565 1,5,25,125,625,3125,15625,78125,390625,1953125,9765625,48828125,
%T A384565 244140625,1220703125,6103515625,30517578125,15148937153,7025209029,
%U A384565 766306777,3831533885,19157669425,27068870389,32265136841,23886730733,16354438561,13052716069
%N A384565 Consecutive states of the linear congruential pseudo-random number generator 5*s mod 2^35 when started at s=1.
%C A384565 Periodic with period 2^35.
%C A384565 A terrible generator that should not be used.
%H A384565 Sean A. Irvine, <a href="/A384565/b384565.txt">Table of n, a(n) for n = 1..10000</a>
%H A384565 Peter G. Behrenz, <a href="https://doi.org/10.1145/368996.368971">Algorithm 133: Random</a>, C ACM, 5, 11 (1962), p. 553.
%H A384565 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>.
%F A384565 a(n) = 5 * a(n-1) mod 2^35.
%p A384565 a:= proc(n) option remember; `if`(n<2, n,
%p A384565       irem(5*a(n-1), 2^35))
%p A384565     end:
%p A384565 seq(a(n), n=1..26);  # _Alois P. Heinz_, Jun 04 2025
%t A384565 k = 1; {k}~Join~Table[k = Mod[5*k, 2^35], {n, 2, 26}] (* _Michael De Vlieger_, Jun 04 2025 *)
%Y A384565 Cf. A000351, A384160, A384316.
%K A384565 nonn,easy
%O A384565 1,2
%A A384565 _Sean A. Irvine_, Jun 04 2025