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 A384401 #13 May 30 2025 11:26:24 %S A384401 1,40014,1601120196,1346387765,439883729,732249858,2127568003, %T A384401 1962667596,707287434,1860990862,1695805043,1904850491,53445315, %U A384401 1814689225,112933431,612891482,2124954851,479214492,407948861,643161691,28884682,445508654,322224693,7553450 %N A384401 Consecutive states of the linear congruential pseudo-random number generator 40014*s mod (2^31-85) when started at s=1. %C A384401 Periodic with period 2^31-86. %H A384401 Sean A. Irvine, <a href="/A384401/b384401.txt">Table of n, a(n) for n = 1..10000</a> %H A384401 Pierre L'Ecuyer, <a href="https://doi.org/10.1145/62959.62969">Efficient and portable combined random number generators</a>, Commun. ACM, 31, 6 (1988), 742-749 and 774. %H A384401 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384401 a(n) = 40014 * a(n-1) mod (2^31-85). %t A384401 NestList[Mod[40014*#, 2^31 - 85] &, 1, 50] (* _Paolo Xausa_, May 30 2025 *) %Y A384401 Cf. A384397, A384398, A384399, A384400, A384402. %Y A384401 Cf. A096550-A096561 other pseudo-random number generators. %K A384401 nonn,easy %O A384401 1,2 %A A384401 _Sean A. Irvine_, May 27 2025