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 A383956 #21 May 25 2025 20:48:31 %S A383956 1,7771826,12906479,12752200,14370573,4177230,16102619,5888068, %T A383956 8967385,14199722,1838727,7559424,14513509,9092550,15771891,2282364, %U A383956 11580593,15929250,14479391,2474936,6872765,1998142,6754315,6251956,4652937,6660762,6157495,1357168 %N A383956 Consecutive states of the linear congruential pseudo-random number generator used by BASIC on the Poly-1 computer when started at 1. %C A383956 The sequence is periodic with period 2^24. %C A383956 In Poly-1 BASIC, random numbers were generated with the RND(m) function. With RND(0) the internal state was returned as a floating-point number state/2^24, otherwise the state was return modulo m. %H A383956 Sean A. Irvine, <a href="/A383956/b383956.txt">Table of n, a(n) for n = 1..10000</a> %H A383956 Andrew Trotman, <a href="https://www.cs.otago.ac.nz/homepages/andrew/poly/Poly.htm">The Poly Preservation Project</a> %H A383956 Wikipedia, <a href="https://en.wikipedia.org/wiki/Poly-1">Poly-1</a> %H A383956 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a> %F A383956 a(n) = (4253261 * a(n-1) + 3518565) mod 2^24. %p A383956 a:= proc(n) option remember; `if`(n<2, n, %p A383956 irem(4253261*a(n-1)+3518565, 2^24)) %p A383956 end: %p A383956 seq(a(n), n=1..28); # _Alois P. Heinz_, May 21 2025 %t A383956 NestList[Mod[4253261*# + 3518565, 2^24] &, 1, 50] (* _Paolo Xausa_, May 22 2025 *) %Y A383956 Cf. A096550-A096561 other pseudo-random number generators. %K A383956 nonn,easy %O A383956 1,2 %A A383956 _Sean A. Irvine_, May 15 2025