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 A384429 #13 Jun 12 2025 22:03:13 %S A384429 1,16807,282475249,1622647863,947787489,1578110407,1878557649, %T A384429 613813847,2005365185,1564292583,1570623665,602936439,1724879009, %U A384429 1159739911,1187094929,1381381783,437908353,499227175,292517489,751367351,1027218017,832165447,1791151953 %N A384429 Consecutive states of the linear congruential pseudo-random number generator for Prime Sheffield Pascal when started at 1. %C A384429 Periodic with period 2^28 (considerably less than the modulus). %C A384429 A weak version of A096550. %D A384429 J. R. Gilbert, The University of Sheffield Pascal System for Prime Computers, University of Sheffield, 1987 (see p. 10). %H A384429 Sean A. Irvine, <a href="/A384429/b384429.txt">Table of n, a(n) for n = 1..10000</a> %H A384429 Stephen K. Park and Keith W. Miller, <a href="https://doi.org/10.1145/63039.63042">Random number generators: good ones are hard to find</a>, Communications of the ACM, Vol 31, 10 (1988), 192-201. %H A384429 B. D. Ripley, <a href="https://doi.org/10.2307/1402590">Computer Generation of Random Variables: A Tutorial</a>, International Statistical Review, 51 (1983), 301-309. %H A384429 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384429 a(n) = 16807 * a(n-1) mod 2^31. %t A384429 NestList[Mod[16807*#, 2^31] &, 1, 50] (* _Paolo Xausa_, May 30 2025 *) %Y A384429 Cf. A096550. %K A384429 nonn,easy %O A384429 1,2 %A A384429 _Sean A. Irvine_, May 28 2025