The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #27 Aug 29 2024 11:54:45
%S 2147483398,2147442707,491644535,44073136,275411947,1494571342,
%T 367188984,1612130085,1622029567,724872099,810967243,1649143122,
%U 223185073,139696145,126975187,29251410,592572674,1023646436,1632766708,1701483674,1908878648,1615402586,1642669521
%N Consecutive internal states of the second of the two linear congruential random number generators whose combined output is used in function RANDOM_NUMBER in version 8 of the Intel FORTRAN Compiler for Linux, using its intrinsic initialization.
%C This is part 2 of a combined pseudorandom number generator proposed by Pierre L'Ecuyer. For more information, references and links see A096560. For the spectral properties see Table 1, line 21, on page 106 of Knuth's TAOCP Vol. 2.
%C This sequence has period 2^31 - 250. - _Charles R Greathouse IV_, Sep 10 2015
%D P. L'Ecuyer, Efficient and portable combined random number generators, Communications of the ACM, v.31 n.6, p. 742-751 and 774, 1988.
%D D. E. Knuth, The Art of Computer Programming Third Edition. Vol. 2 Seminumerical Algorithms. Chapter 3.3.4 The Spectral Test, Page 108. Addison-Wesley 1997.
%H Alois P. Heinz, <a href="/A096561/b096561.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Per#periodic">Index entries for periodic sequences with large period</a>.
%H <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers</a>.
%F a(1)=2^31-250, a(n)=40692*a(n-1) mod (2^31-249).
%p a:= proc(n) option remember; `if`(n=1, 2147483398,
%p irem(40692 *a(n-1), 2147483399))
%p end:
%p seq(a(n), n=1..30); # _Alois P. Heinz_, Jun 10 2014
%t NestList[Mod[#*40692, 2^31 - 249] &, 2^31 - 250, 50] (* _Paolo Xausa_, Aug 29 2024 *)
%o (PARI) a(n)=lift(-Mod(40692,2147483399)^(n-1)) \\ _M. F. Hasler_, May 14 2015
%Y Cf. A096550-A096560, A061364.
%K nonn,easy
%O 1,1
%A _Hugo Pfoertner_, Aug 13 2004