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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A281598 Numbers k such that A001222(k) = A001222(A000041(k)). 3
 1, 2, 3, 5, 13, 18, 20, 42, 45, 50, 63, 65, 87, 93, 95, 102, 104, 114, 121, 123, 140, 143, 146, 148, 150, 152, 157, 160, 161, 162, 172, 175, 190, 195, 196, 198, 203, 204, 210, 218, 224, 228, 232, 234, 235, 238, 242, 244, 245, 260, 270, 275, 276, 287, 315 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Numbers k such that the number of prime divisors (counted with multiplicity) of k is equal to the number of prime divisors (counted with multiplicity) of the number of partitions of k. LINKS Amiram Eldar, Table of n, a(n) for n = 1..1000 (terms 1..100 from Colin Barker, terms 101..210 from Indranil Ghosh) MATHEMATICA Select[Range[2000], PrimeOmega[#]==PrimeOmega[PartitionsP[#]] &] (* Indranil Ghosh, Mar 09 2017 *) PROG (PARI) select(n->bigomega(n)==bigomega(numbpart(n)), vector(400, n, n)) CROSSREFS Cf. A000041, A001222, A281597, A281599. Sequence in context: A073919 A162573 A087356 * A042261 A112596 A179238 Adjacent sequences:  A281595 A281596 A281597 * A281599 A281600 A281601 KEYWORD nonn AUTHOR Colin Barker, Jan 25 2017 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.

Last modified December 5 06:30 EST 2021. Contains 349532 sequences. (Running on oeis4.)