cp's OEIS Frontend

A384158 Consecutive states of the linear congruential pseudo-random number generator for 16-bit WATFOR/WATFIV when started at 1.

%I A384158 #22 May 26 2025 06:32:50
%S A384158 1,253,31241,6885,5201,5133,20697,26229,16801,23581,2217,3845,22513,
%T A384158 26925,29049,9365,10049,19261,23369,14117,32657,4685,5657,22197,12513,
%U A384158 20061,29161,4933,2865,3949,16057,31957,24193,25981,19593,9061,31441,24717,27481,5877
%N A384158 Consecutive states of the linear congruential pseudo-random number generator for 16-bit WATFOR/WATFIV when started at 1.
%C A384158 Periodic with period 8192 (considerably less than the modulus).
%C A384158 WATFOR and WATFIV are early FORTRAN compilers from the University of Waterloo.
%D A384158 Terry M. Walker, Fundamentals of Fortran Programming: with WATFOR/WATFIV, Allyn and Bacon, 1975.
%H A384158 Sean A. Irvine, <a href="/A384158/b384158.txt">Table of n, a(n) for n = 1..8192</a>
%H A384158 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
%H A384158 <a href="/index/Rec#order_8192">Index entries for linear recurrences with constant coefficients</a>, order 8192.
%F A384158 a(n) = 253 * a(n-1) mod 2^15.
%F A384158 a(n) == 1 (mod 4). - _Hugo Pfoertner_, May 26 2025
%p A384158 a:= proc(n) option remember; `if`(n<2, n,
%p A384158       irem(253*a(n-1), 2^15))
%p A384158     end:
%p A384158 seq(a(n), n=1..40);  # _Alois P. Heinz_, May 21 2025
%t A384158 NestList[Mod[253*#, 2^15] &, 1, 100] (* _Paolo Xausa_, May 22 2025 *)
%Y A384158 Cf. A384159, A384160.
%Y A384158 Cf. A096550-A096561 other pseudo-random number generators.
%K A384158 nonn,easy
%O A384158 1,2
%A A384158 _Sean A. Irvine_, May 20 2025