A180258 a(n) = 2^(q*r) mod p for the n-th odd number with exactly 3 distinct prime factors p < q < r.

2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 4, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 2, 2, 4, 2, 2, 3, 2, 2, 2, 2, 4, 2, 2, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2

Offset: 1

Author

Juri-Stepan Gerasimov, Jan 17 2011

Keywords

• nonn

Examples

			a(1) = 2^(5*7) mod 3 = 2, because A046389(1) = 105 = 3*5*7 and 3 < 5 < 7.
		

Links

• Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A046389, A180197, A180257.

Extensions

More terms and corrected a(28) from Nathaniel Johnston, Jan 18 2011