OFFSET
1,1
COMMENTS
The C++ Mersenne twister uses a different seeding procedure than the one in Matsumoto and Nishimura's paper.
LINKS
Eric M. Schmidt, Table of n, a(n) for n = 1..1000
Makoto Matsumoto and Takuji Nishimura, Mersenne Twister: A 623-dimensionally equidistributed uniform pseudo-random number generator, ACM Transactions on Modeling and Computer Simulation: Special Issue on Uniform Random Number Generation, Vol. 8, No. 1, January 1998, pp. 3-30.
PROG
(C++)
#include <iostream>
#include <random>
void A221557(int max)
{
std::mt19937 gen;
for (int i = 1; i <= max; ++i)
std::cout << i << ' ' << gen() << '\n';
}
CROSSREFS
KEYWORD
nonn
AUTHOR
Eric M. Schmidt, Jan 20 2013
STATUS
approved