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 A384405 #10 Jun 04 2025 10:53:45 %S A384405 1,69621,552116347,1082396834,201323037,1832878655,1219051368, %T A384405 874078441,971035822,1699755902,1619285207,1953863635,1883480414, %U A384405 143449980,1332099030,837788288,2002546328,344571154,1995975644,300997201,580703395,623924873,1121855264 %N A384405 Consecutive internal states of the linear congruential pseudo-random number generator 69621 * s mod (2^31-1) when started at s=1. %C A384405 Periodic with period 2^31-2. %C A384405 Presented by Carta as an alternative to Park and Miller's Minimal Standard Generator. %H A384405 Sean A. Irvine, <a href="/A384405/b384405.txt">Table of n, a(n) for n = 1..10000</a> %H A384405 David G. Carta, <a href="https://doi.org/10.1145/76372.76379">Two Fast Implementations of the "Minimal Standard" Random Number Generator</a>, C ACM, 33, 1 (1990), 87-88. %H A384405 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384405 a(n) = 69621 * a(n-1) mod (2^31-1). %t A384405 NestList[Mod[69621*#, 2^31 - 1] &, 1, 50] (* _Paolo Xausa_, Jun 04 2025 *) %Y A384405 Cf. A096550, A384404. %K A384405 nonn,easy %O A384405 1,2 %A A384405 _Sean A. Irvine_, May 27 2025