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 A384387 #71 May 30 2025 03:44:44 %S A384387 1,20754104794,34326110303,33058783648,5709053037,32799031638, %T A384387 11541606315,32442345084,2725994905,16337875602,5290419639, %U A384387 32195142424,16205355909,13352325518,14174310019,8003654516,31661086257,1566661194,21726656015,17779217296,34005826973 %N A384387 Consecutive states of the linear congruential pseudo-random number generator (13493037709*s+7261067085) mod 2^35 when started at s=1. %C A384387 Periodic with period 2^35. %C A384387 Proposed by Dyck et al. for FORTRAN 77 on Honeywell computers. %D A384387 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 A384387 Sean A. Irvine, <a href="/A384387/b384387.txt">Table of n, a(n) for n = 1..10000</a> %H A384387 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>. %F A384387 a(n) = (13493037709 * a(n-1) + 7261067085) mod 2^35. %p A384387 a:= proc(n) option remember; `if`(n<2, n, %p A384387 irem(13493037709*a(n-1)+7261067085, 2^35)) %p A384387 end: %p A384387 seq(a(n), n=1..21); # _Alois P. Heinz_, May 29 2025 %t A384387 NestList[Mod[13493037709*# + 7261067085, 2^35] &, 1, 50] (* _Paolo Xausa_, May 30 2025 *) %Y A384387 Cf. A384217. %K A384387 nonn,easy %O A384387 1,2 %A A384387 _Sean A. Irvine_, May 29 2025