A096554 Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0.

0, 21468, 9988, 22117, 3498, 16927, 16045, 19741, 12122, 8410, 12261, 27052, 5659, 9758, 21087, 25875, 32368, 26233, 15212, 17661, 20496, 8191, 23065, 23471, 32096, 10781, 14596, 23212, 24244, 5661, 514, 25643, 1350, 19576, 8051, 18234, 16882, 13023, 5983, 21166

Offset: 1

Author

Hugo Pfoertner, Jul 18 2004

Keywords

• nonn

Comments

This sequence and A061364 are generated by the same algorithm but with different seed: A061364 (as well as A096553 which is the sequence of internal states of the generator) has seed 1, while this sequence has seed 0. [Corrected by Jean-Claude Arbaut, Oct 05 2015]

References

• Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language (Second Edition), Prentice Hall Software Series, 1988, page 46.

Links

• Paolo Xausa, Table of n, a(n) for n = 1..10000
• Index entries for sequences related to pseudo-random numbers.

Crossrefs

Cf. A096550-A096561 for other pseudo-random number generators.

A061364 is the same generator seeded with 1.

Programs

C

static unsigned int next = 0; int rand( ) { next = next * 1103515245 + 12345; return ((next >>16) & 32767); }

Mathematica

BitShiftRight[NestList[Mod[#*1103515245 + 12345, 2^31] &, 12345, 50], 16] (* Paolo Xausa, Aug 29 2024 *)

PARI

x(n) = if(n<1, 0, (1103515245 * x(n-1) + 12345) % (2^31));
vector(100, n, floor(x(n)/2^16)) \\ Altug Alkan, Oct 05 2015

Formula

Correction of seed value and second formula from David Fifield, May 23 2024: (Start)

x(0) = 0, x(n) = (1103515245 * x(n-1) + 12345) mod 2^31, a(n) = floor(x(n)/2^16).

a(n) = A061364(n + 1212780038). (End)

Extensions

Name amended (start at 0) by David Fifield, May 23 2024