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.

2, 16, 27, 0, 60, 72, 105, 0, 0, 150, 220, 180, 0, 308, 240, 256, 476, 288, 627, 440, 378, 0, 805, 528, 450, 624, 594, 560, 1160, 540, 1581, 576, 0, 1122, 0, 648, 1776, 1748, 0, 800, 3526, 0, 2322, 1056, 900, 0, 3055, 960, 0, 0, 1530, 1456, 4028

Offset

1,1

Links

Table of n, a(n) for n=1..53.

Example

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.

Crossrefs

Cf. A001414, A056240.

Sequence in context: A344989 A276069 A190046 * A067555 A108705 A113933

Adjacent sequences: A067563 A067564 A067565 * A067567 A067568 A067569

Keyword

easy,nonn

Author

Naohiro Nomoto, Jan 30 2002

Extensions

Edited by Henry Bottomley, Jul 07 2002

Status

approved