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 A382535 #40 Jun 17 2025 22:35:01 %S A382535 1,23,529,12167,279841,6436343,48035888,4825413,10984498,52643452, %T A382535 10799384,48385830,12874079,96103815,10387723,38917627,95105413, %U A382535 87424478,10762974,47548400,93613190,53103349,21377015,91671341,8440822,94138905,65194794,99480248 %N A382535 Consecutive states of Lehmer's original linear congruential pseudo-random number generator 23*s mod (10^8+1) when started at s=1. %C A382535 Periodic with period 5882352. %C A382535 This is the first linear congruential pseudo-random number generator described in the literature. As such, it is the forerunner of one of the most widely used techniques for generating pseudo-random numbers. %H A382535 Sean A. Irvine, <a href="/A382535/b382535.txt">Table of n, a(n) for n = 1..10000</a> %H A382535 D. H. Lehmer, <a href="https://archive.org/details/proceedings_of_a_second_symposium_on_large-scale_/page/n178">Mathematical methods in large-scale computing units</a>, Proceedings of a Second Symposium on Large-Scale Digital Calculating Machinery (1949), 141-146. %H A382535 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 A382535 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A382535 a(n) = 23 * a(n-1) mod (10^8+1). %t A382535 NestList[Mod[23*#, 10^8 + 1] &, 1, 50] (* _Paolo Xausa_, May 26 2025 *) %Y A382535 Cf. A009967. %Y A382535 Cf. A096550-A096561 (other pseudo-random number generators). %K A382535 nonn,easy %O A382535 1,2 %A A382535 _Sean A. Irvine_, May 25 2025