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

2, 2, 3, 1, 3, 1, 2, 2, 1, 2, 1, 6, 3, 4, 2, 1, 3, 2, 2, 1, 3, 7, 2, 1, 8, 4, 2, 10, 5, 6, 1, 3, 2, 1, 2, 5, 1, 3, 10, 7, 2, 1, 2, 2, 2, 8, 10, 2, 4, 3, 2, 1, 8, 15, 2, 5, 2, 7, 1, 2, 10, 1, 4, 6, 12, 3, 8, 1, 6, 2, 8, 3, 8, 9, 1, 11, 4, 3, 1, 2, 7, 2, 15, 10, 8

Offset

1,1

Links

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

Example

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

Crossrefs

Cf. A046389, A180197.

Sequence in context: A077083 A274528 A166248 * A265576 A083040 A083899

Adjacent sequences: A180254 A180255 A180256 * A180258 A180259 A180260

Keyword

nonn

Author

Juri-Stepan Gerasimov, Jan 17 2011

Extensions

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

Status

approved