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 A384331 #47 Jun 19 2025 19:56:33 %S A384331 1,2745024,1210316419,415139642,1736732949,1256316804,1030492215, %T A384331 752224798,1924036713,1766988168,1603301931,373929026,1844513277, %U A384331 1525789900,1102819423,652855718,32201169,196285776,782671571,316395082,356309989,2122833684,957108615 %N A384331 Consecutive internal states of a linear congruential pseudo-random number generator for Microsoft C and C++ when started at 1. %C A384331 Periodic with period 2^31. %C A384331 Also used by Microsoft Quick C. %H A384331 Sean A. Irvine, <a href="/A384331/b384331.txt">Table of n, a(n) for n = 1..10000</a> %H A384331 Guglielmo Morgari, <a href="https://iris.polito.it/retrieve/9539c0eb-79e8-40c7-bf2c-bc27d54b2c07/GuglielmoMorgari_PhD_Thesis.pdf">Randomness Tests for Binary Sequences</a>, PhD Thesis, Univ. of Torino, 2023. %H A384331 Wikipedia, <a href="https://en.wikipedia.org/wiki/Linear_congruential_generator">Linear congruential generator</a> %H A384331 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384331 a(n) = (214013 * a(n-1) + 2531011) mod 2^31. %t A384331 NestList[Mod[214013*#+2531011,2^31]&,1,27] (* _Vincenzo Librandi_, May 29 2025 *) %o A384331 (Magma) [n le 1 select 1 else (214013 * Self(n-1) + 2531011) mod 2^31: n in [1..30]]; // _Vincenzo Librandi_, May 29 2025 %Y A384331 Cf. A384289 (24-bit modulus), A096557 (32-bit modulus). %K A384331 nonn,easy %O A384331 1,2 %A A384331 _Sean A. Irvine_, May 28 2025