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!)
 A281599 Numbers k such that A000005(k) = A000005(A000041(k)). 3
 1, 2, 3, 5, 8, 13, 42, 56, 65, 87, 93, 95, 102, 108, 114, 123, 143, 146, 157, 161, 190, 195, 198, 200, 203, 210, 218, 234, 235, 238, 266, 275, 287, 312, 321, 370, 375, 380, 385, 410, 416, 437, 475, 491, 513, 568, 572, 582, 590, 626, 627, 636, 660, 685, 702 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Numbers k such that the number of divisors of k is equal to the number of divisors of the number of partitions of k. LINKS Charles R Greathouse IV and Amiram Eldar, Table of n, a(n) for n = 1..500 (terms 1..225 from Charles R Greathouse IV) MATHEMATICA Select[Range[1500], DivisorSigma[0, #] == DivisorSigma[0, PartitionsP[#]] &] (* Indranil Ghosh, Mar 09 2017 *) PROG (PARI) select(n->numdiv(n)==numdiv(numbpart(n)), vector(750, n, n)) CROSSREFS Cf. A000005, A000041, A281597, A281598. Sequence in context: A273045 A014259 A001129 * A041957 A329192 A294939 Adjacent sequences:  A281596 A281597 A281598 * A281600 A281601 A281602 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 1 11:07 EST 2021. Contains 349429 sequences. (Running on oeis4.)