155943
domain: N
Appears in sequences
- Stopping times (see Borwein-Loring article for precise definition).at n=9A007176
- a(n) = smallest composite (odd) number greater than a(n-1) such that a(n)+2n is the first prime after a(n).at n=31A189118
- Lagged Fibonacci Generator: a(n) = (100003 - 200003*n + 300007*n^3) mod 10^6 for n <= 55, a(n) = (a(n-24) + a(n-55)) mod 10^6.at n=19A380292