cp's OEIS Frontend

A270337 Composite numbers equal to the number of divisors of one of their powers.

%I A270337 #18 Sep 29 2018 01:49:26
%S A270337 9,25,28,40,45,49,81,121,153,169,225,289,325,343,361,441,529,625,640,
%T A270337 841,961,976,1089,1225,1369,1521,1681,1849,2133,2197,2209,2401,2541,
%U A270337 2601,2809,3025,3249,3481,3721,4225,4489,4753,4761,4851,5041,5329,5929,6241,6348,6561,6859,6889
%N A270337 Composite numbers equal to the number of divisors of one of their powers.
%C A270337 Prime numbers are not considered since every prime p satisfies p = d(p^(p-1)), where d() represents the number of divisors.
%C A270337 In general, p^k = d((p^k)^((p^k-1)/k)) for any prime p and for any power k such that (p^k-1)/k is an integer.
%H A270337 Paolo P. Lava, <a href="/A270337/a270337.txt">First 50 terms with their powers</a>
%e A270337 9 = d(9^4); 28 = d(28^3); 153 = d(153^8); etc.
%p A270337 with(numtheory): P:=proc(q) local a,k,n;
%p A270337 for n from 2 to q do if not isprime(n) then a:=tau(n); k:=0;
%p A270337 while a<n do k:=k+1; a:=tau(n^k); od; if n=a then print(n); fi; fi; od; end: P(10^6);
%t A270337 nn = 2000; Select[Select[Range@ nn, CompositeQ], Function[k, (SelectFirst[k^Range[nn/2], DivisorSigma[0, #] == k &] /. n_ /; MissingQ@ n -> 0) > 0]] (* _Michael De Vlieger_, Mar 17 2016, Version 10.2 *)
%Y A270337 Cf. A000005, A073049, A270389.
%K A270337 nonn,easy
%O A270337 1,1
%A A270337 _Paolo P. Lava_, Mar 15 2016