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 A221557 #10 Sep 10 2015 01:11:27 %S A221557 3499211612,581869302,3890346734,3586334585,545404204,4161255391, %T A221557 3922919429,949333985,2715962298,1323567403,418932835,2350294565, %U A221557 1196140740,809094426,2348838239,4264392720,4112460519,4279768804,4144164697,4156218106,676943009,3117454609 %N A221557 Consecutive values produced by the C++ mt19937 (Mersenne twister) random number generator with the default seed (5489). %C A221557 The C++ Mersenne twister uses a different seeding procedure than the one in Matsumoto and Nishimura's paper. %H A221557 Eric M. Schmidt, <a href="/A221557/b221557.txt">Table of n, a(n) for n = 1..1000</a> %H A221557 Makoto Matsumoto and Takuji Nishimura, <a href="http://saluc.engr.uconn.edu/refs/crypto/rng/matsumoto98mersenne.pdf">Mersenne Twister: A 623-dimensionally equidistributed uniform pseudo-random number generator</a>, ACM Transactions on Modeling and Computer Simulation: Special Issue on Uniform Random Number Generation, Vol. 8, No. 1, January 1998, pp. 3-30. %H A221557 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a> %o A221557 (C++) %o A221557 #include <iostream> %o A221557 #include <random> %o A221557 void A221557(int max) %o A221557 { %o A221557 std::mt19937 gen; %o A221557 for (int i = 1; i <= max; ++i) %o A221557 std::cout << i << ' ' << gen() << '\n'; %o A221557 } %Y A221557 Cf. A221558. %K A221557 nonn %O A221557 1,1 %A A221557 _Eric M. Schmidt_, Jan 20 2013