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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176175 Numbers k such that (2^(k-1) mod k) = number of prime divisors of k (counted with multiplicity). 1
1, 3, 5, 6, 7, 10, 11, 13, 14, 17, 19, 22, 23, 26, 29, 31, 34, 37, 38, 41, 43, 46, 47, 53, 58, 59, 61, 62, 67, 71, 73, 74, 79, 82, 83, 86, 89, 94, 97, 101, 103, 106, 107, 109, 113, 118, 122, 127, 131 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Numbers k such that A062173(k) = A001222(k).

LINKS

Table of n, a(n) for n=1..49.

FORMULA

A001222(a(n)) = A062173(a(n)).

MAPLE

for n from 1 to 180 do modp(2^(n-1), n) ;  if % = numtheory[bigomega](n) then printf("%d, ", n) ; end if; end do: # R. J. Mathar, Dec 07 2010

CROSSREFS

Cf. A001222, A062173.

Sequence in context: A281995 A304452 A292763 * A157201 A067351 A067350

Adjacent sequences:  A176172 A176173 A176174 * A176176 A176177 A176178

KEYWORD

nonn

AUTHOR

Juri-Stepan Gerasimov, Dec 07 2010

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 January 17 09:54 EST 2020. Contains 330949 sequences. (Running on oeis4.)