Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
editing
approved
<a href="/index/Ps#PRN">Index entries for sequences related to pseudo-random numbers.</a>
approved
editing
proposed
approved
editing
proposed
Consecutive values produced by the C++ knuth_b random number generator with the default seed (1).
#include <random>
#include <random> void A221555(int max)
allocated for Eric M. Schmidt
Consecutive values produced by the C++ knuth_b random number generator with the default seed.
152607844, 823378840, 578354438, 2035308228, 1004016855, 280090412, 101929267, 1784484492, 944975825, 1190959745, 2051724831, 784170963, 1102246882, 1400285365, 915896220, 1070477904, 515204530, 1083454666, 681910962, 269220094, 563613512, 194847408, 1998097157
1,1
The knuth_b generator uses "Algorithm B" (described in the Knuth reference) to permute the values produced by the "minimal standard generator".
Carter Bays and S. D. Durham, "Improving a Poor Random Number Generator", ACM Transactions on Mathematical Software, vol. 2, issue 1 (March 1976), pp. 59-64.
D. E. Knuth, The Art of Computer Programming, 2nd Edition, vol. 2 Seminumerical Algorithms, Addison-Wesley, 1981, pp. 32-33.
Eric M. Schmidt, <a href="/A221555/b221555.txt">Table of n, a(n) for n = 1..1000</a>
(C++)
#include <iostream>
#include <random> void A221555(int max)
{
std::knuth_b gen;
for (int i = 1; i <= max; ++i)
std::cout << i << ' ' << gen() << '\n';
}
Cf. A096550.
allocated
nonn
Eric M. Schmidt, Jan 19 2013
approved
editing
allocating
allocated
allocated for Eric M. Schmidt
allocating
approved