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 A221558 #10 Sep 10 2015 01:11:29 %S A221558 14514284786278117030,4620546740167642908,13109570281517897720, %T A221558 17462938647148434322,355488278567739596,7469126240319926998, %U A221558 4635995468481642529,418970542659199878,9604170989252516556,6358044926049913402,5058016125798318033,10349215569089701407 %N A221558 Consecutive values produced by the C++ mt19937_64 (Mersenne twister) random number generator with the default seed (5489). %C A221558 This is a 64-bit version of the Mersenne twister. %H A221558 Eric M. Schmidt, <a href="/A221558/b221558.txt">Table of n, a(n) for n = 1..1000</a> %H A221558 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 A221558 <a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a> %o A221558 (C++) %o A221558 #include <iostream> %o A221558 #include <random> %o A221558 void A221558(int max) %o A221558 { %o A221558 std::mt19937_64 gen; %o A221558 for (int i = 1; i <= max; ++i) %o A221558 std::cout << i << ' ' << gen() << '\n'; %o A221558 } %Y A221558 Cf. A221557. %K A221558 nonn %O A221558 1,1 %A A221558 _Eric M. Schmidt_, Jan 20 2013