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 A096557 #18 Aug 29 2024 06:09:50 %S A096557 0,2531011,505908858,3539360597,159719620,2727824503,773150046, %T A096557 548247209,2115878600,2832368235,2006221698,2531105853,3989110284, %U A096557 2222380191,2165923046,1345953809,1043415696,586225427,3870123402,2343900709,3109564500,3522190791,2090033518,3566711417 %N A096557 Consecutive internal states of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++. %H A096557 Alois P. Heinz, <a href="/A096557/b096557.txt">Table of n, a(n) for n = 1..10000</a> %H A096557 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a> %F A096557 a(1)=0, a(n)=(a(n-1) * 214013 + 2531011) mod 2^32. The sequence is periodic with period length 2^32. %p A096557 a:= proc(n) option remember; `if`(n<2, 0, %p A096557 irem(214013 *a(n-1) +2531011, 4294967296)) %p A096557 end: %p A096557 seq(a(n), n=1..30); # _Alois P. Heinz_, Jun 10 2014 %t A096557 NestList[Mod[#*214013 + 2531011, 2^32] &, 0, 50] (* _Paolo Xausa_, Aug 29 2024 *) %o A096557 (PARI) A096557(n)=lift((Mod(214013,2^34)^(n-1)-1)*13129821757)>>2 \\ _M. F. Hasler_, May 14 2015 %Y A096557 Cf. A096558 corresponding output. A096550-A096561 other pseudo-random number generators. %K A096557 nonn %O A096557 1,2 %A A096557 _Hugo Pfoertner_, Jul 21 2004