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 A384293 #12 Jun 19 2025 19:54:42 %S A384293 1,13737668,4492923,1465174,1188037,13716600,8738143,9934506,13614793, %T A384293 13927020,11895683,4496446,458253,7197856,2514151,3121170,8864401, %U A384293 3086100,2844043,6755878,2240597,10706376,942447,16495226,10660697,5962940,2184339,16607502 %N A384293 Consecutive internal states of the pseudo-random number generator (214013*(s mod 2^16)+13523655) mod 2^24 when started at s=1. %C A384293 Periodic with period 2^16 (note 1 is not part of the repeating cycle). %C A384293 This generator was used in IBM BASIC and was an erroneous attempt to implement (214013*s+13523655) mod 2^24 (see A384292). %D A384293 G. Sawitzki, Another random number generator which should be avoided, Statistical Software Newsletter, 11 (1985), 81-82. %H A384293 Sean A. Irvine, <a href="/A384293/b384293.txt">Table of n, a(n) for n = 1..65537</a> %H A384293 B. D. Ripley, <a href="https://doi.org/10.1016/0377-0427(90)90346-2">Thoughts on pseudorandom number generators</a>, J of Computational and Applied Mathematics, 31, 1 (1990), 153-163. %H A384293 W. E. Sharp and Carter Bays, <a href="https://doi.org/10.1016/0098-3004(92)90060-5">A review of portable random number generators</a>, Computers and Geosciences, 18, 1 (1982), 79-87. %H A384293 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384293 a(n) = (214013 * (s mod 2^16) + 13523655) mod 2^24. %t A384293 NestList[Mod[214013*Mod[#, 2^16] + 13523655, 2^24] &, 1, 50] (* _Paolo Xausa_, May 27 2025 *) %Y A384293 Cf. A384289, A384290, A384291, A384292. %K A384293 nonn,easy %O A384293 1,2 %A A384293 _Sean A. Irvine_, May 24 2025