cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A323732 Numbers k for which there exists no j > 1 such that j^k has exactly j divisors.

This page as a plain text file.
%I A323732 #10 Jan 27 2019 08:47:22
%S A323732 5,14,21,41,50,54,67,76,86,90,111,113,119,131,142,153,165,175,186,202,
%T A323732 204,216,224,230
%N A323732 Numbers k for which there exists no j > 1 such that j^k has exactly j divisors.
%C A323732 This sequence lists the numbers k such that A073049(k) = 0.
%C A323732 Equivalently:
%C A323732 numbers k for which the only number j such that j^k has exactly j divisors is 1;
%C A323732 numbers k such that A323731(k)=1;
%C A323732 numbers k such that A323734(k)=1.
%C A323732 The complement of this sequence is A323733.
%C A323732 The next terms after a(24)=230 appear to be 233, 253, 269, 273, 285, 293, 303, 307, 318, 321, 328, 345, 354, 357, 369, 370, 373, 384, 393, 402, 410, 412, 414, 426, 429, 431, 440, 441, 445, 468, ...
%e A323732 There exists no j > 1 such that j^5 has exactly j divisors, so 5 is a term.
%e A323732 For k=15 and j=976, j^k = 976^15 = (2^4 * 61)^15 = 2^60 * 61^15, which has exactly (60+1)*(15+1) = 61*16 = 976 = j divisors, so k=15 is not a term.
%Y A323732 Cf. A000005, A073049, A323730, A323731, A323733, A323734.
%K A323732 nonn,more
%O A323732 1,1
%A A323732 _Jon E. Schoenfield_, Jan 26 2019