cp's OEIS Frontend

A067566 Smallest k such that k = n*A001414(k) (or 0 if no such k exists), where A001414(k) is the integer log of k, i.e., Sum p_i*e_i if the prime factorization of k is Product p_i^e_i.

%I A067566 #6 Jul 31 2017 03:30:50
%S A067566 2,16,27,0,60,72,105,0,0,150,220,180,0,308,240,256,476,288,627,440,
%T A067566 378,0,805,528,450,624,594,560,1160,540,1581,576,0,1122,0,648,1776,
%U A067566 1748,0,800,3526,0,2322,1056,900,0,3055,960,0,0,1530,1456,4028
%N A067566 Smallest k such that k = n*A001414(k) (or 0 if no such k exists), where A001414(k) is the integer log of k, i.e., Sum p_i*e_i if the prime factorization of k is Product p_i^e_i.
%e A067566 a(3)=27 since 27 = 3^3 and 27 = 3*(3*3), but not 30 even though 30 = 2^1*3^1*5^1 and 30 = 3*(2*1+3*1+5*1) because 27 is less than 30.
%Y A067566 Cf. A001414, A056240.
%K A067566 easy,nonn
%O A067566 1,1
%A A067566 _Naohiro Nomoto_, Jan 30 2002
%E A067566 Edited by _Henry Bottomley_, Jul 07 2002