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 A384546 #12 Jun 04 2025 11:30:19 %S A384546 1,1732073221,2616616473,729251197,2797858417,533270325,3854126857, %T A384546 3936328237,2856078817,3879861349,3089187065,2416960477,1835568721, %U A384546 733302421,616573929,1009912461,1831411649,1402287557,1780547545,2404171325,3232723505,1340662261,515353801 %N A384546 Consecutive states of the linear congruential pseudo-random number generator 1732073221*s mod 2^32 when started at s=1. %C A384546 Periodic with period 2^30. %H A384546 Sean A. Irvine, <a href="/A384546/b384546.txt">Table of n, a(n) for n = 1..10000</a> %H A384546 George S. Fishman, <a href="https://doi.org/10.2307/2008698">Multiplicative Congruential Random Number Generators with Modulus 2^beta: An Exhaustive Analysis for beta = 32 and a Partial Analysis for beta = 48</a>, Math. Comp., 54, 189 (1990), 331-344. %H A384546 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384546 a(n) = 1732073221 * a(n-1) mod 2^32. %p A384546 a:= proc(n) option remember; `if`(n<2, n, %p A384546 irem(1732073221*a(n-1), 2^32)) %p A384546 end: %p A384546 seq(a(n), n=1..23); # _Alois P. Heinz_, Jun 02 2025 %t A384546 NestList[Mod[1732073221*#, 2^32] &, 1, 50] (* _Paolo Xausa_, Jun 04 2025 *) %Y A384546 Cf. A384489, A384534, A384547, A384548, A384549, A384550, A384551, A384552. %K A384546 nonn,easy %O A384546 1,2 %A A384546 _Sean A. Irvine_, Jun 02 2025