login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180258 a(n) = 2^(q*r) mod p for n-th odd number with exactly 3 distinct prime factors p<q<r. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

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

CROSSREFS

Cf. A046389, A180197, A180257.

Sequence in context: A133502 A296078 A137325 * A211663 A000195 A135663

Adjacent sequences:  A180255 A180256 A180257 * A180259 A180260 A180261

KEYWORD

nonn

AUTHOR

Juri-Stepan Gerasimov, Jan 17 2011

EXTENSIONS

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 14:04 EDT 2020. Contains 334827 sequences. (Running on oeis4.)