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 A385102 #8 Jun 18 2025 05:21:23 %S A385102 1,907633514,2028239699,557549500,4112042149,3080093198,3102664695, %T A385102 1719420512,3669547337,1832837298,1120443547,3710930180,2876256749, %U A385102 2577566550,2701236543,1474796456,2177815185,2672918010,2116672995,3375510092,2556738357,14399646 %N A385102 Consecutive internal states of the linear congruential pseudo-random number generator for Turbo Pascal 3.0 when started at 1. %H A385102 Sean A. Irvine, <a href="/A385102/b385102.txt">Table of n, a(n) for n = 1..10000</a> %H A385102 J. Eichenauer-Herrmann and H. Grothe, <a href="https://doi.org/10.1016/0377-0427(90)90337-Y">Upper bounds for the Beyer ratios of linear congruential generators</a>, J Comp. Appl. Math., 31 1 (1990), 73-80. %H A385102 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 A385102 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A385102 a(n) = (129 * a(n-1) + 907633385) mod 2^32. %t A385102 NestList[Mod[129# + 907633385, 2^32] &,1,21] (* _Stefano Spezia_, Jun 18 2025 *) %Y A385102 Cf. A384429, A384404, A384432. %K A385102 nonn,easy %O A385102 1,2 %A A385102 _Sean A. Irvine_, Jun 17 2025