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 A384217 #24 May 30 2025 03:43:53 %S A384217 1,1297131554,17103983,1426780792,2111429773,1142766270,888797147, %T A384217 1081516660,1471148505,488941338,1429379591,2081849904,166513637, %U A384217 1928300854,1776832243,142642604,236172977,1916812562,182141599,551190760,1397538365,1487855278,1455317259 %N A384217 Consecutive states of the linear congruential pseudo-random number generator (843314861*s+453816693) mod 2^31 when started at s=1. %C A384217 Periodic with period 2^31 (Dyck et al. mistakenly give the period as 2^29). %C A384217 Proposed by Dyck et al. for FORTRAN 77 on VAX or IBM computers. %D A384217 V. A. Dyck, J. D. Lawson, and J. A. Smith, FORTRAN 77: An Introduction to Structured Problem Solving, Reston Pub. Co., 1984 (see p. 467). %H A384217 Sean A. Irvine, <a href="/A384217/b384217.txt">Table of n, a(n) for n = 1..10000</a> %H A384217 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384217 a(n) = (843314861 * a(n-1) + 453816693) mod 2^31. %p A384217 a:= proc(n) option remember; `if`(n<2, n, %p A384217 irem(843314861*a(n-1)+453816693, 2^31)) %p A384217 end: %p A384217 seq(a(n), n=1..23); # _Alois P. Heinz_, May 29 2025 %t A384217 NestList[Mod[843314861*# + 453816693, 2^31] &, 1, 50] (* _Paolo Xausa_, May 30 2025 *) %Y A384217 Cf. A096550-A096561 other pseudo-random number generators. %Y A384217 Cf. A384387. %K A384217 nonn,easy %O A384217 1,2 %A A384217 _Sean A. Irvine_, May 29 2025