This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A384236 #13 Jun 17 2025 17:47:10 %S A384236 1,9807,92400,111649,125103,66530,52814,32564,33629,122410,4243,57352, %T A384236 99123,108674,50015,110480,65066,114640,94945,33358,86404,34681,83713, %U A384236 123077,122366,97063,93248,38593,40982,5807,58629,38569,67780,120711,120937,108886 %N A384236 Consecutive states of the linear congruential pseudo-random number generator (9806*s+1) mod (2^17-1) when started at s=1. %C A384236 Periodic with period length 2^17-2. %C A384236 In the way this generator was defined by Collins, it would return values in the range [1..2^17-1] rather than the more typical [0..2^17-2] (that is, 0 would instead be 2^17-1). %D A384236 William J. Collins, Intermediate Pascal Programming, McGraw-Hill, 1986 (see p. 157). %H A384236 Paolo Xausa, <a href="/A384236/b384236.txt">Table of n, a(n) for n = 1..10000</a> %H A384236 W. E. Sharp and Carter Bays, <a href="https://doi.org/10.1016/0098-3004(92)90060-5">A review of portable random number generators</a>, Computers and Geosciences, 18, 1 (1982), 79-87. %H A384236 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384236 a(n) = (9806 * a(n-1) mod (2^17-1)) + 1. %t A384236 NestList[Mod[9806*#, 2^17 - 1] + 1 &, 1, 50] (* _Paolo Xausa_, May 23 2025 *) %Y A384236 Cf. A096550-A096561 (other pseudo-random number generators). %K A384236 nonn,easy %O A384236 1,2 %A A384236 _Sean A. Irvine_, May 22 2025