A104466 a(n) is the least k with n distinct prime factors such that the sum of its prime factors (counting multiplicity) divides k, or 0 if no such k exists. First member of A036844 with n distinct prime factors.

2, 0, 30, 840, 2730, 72930, 870870, 9699690, 340510170, 9592993410, 265257422430, 8624101075590, 304250263527210, 14299762385778870, 1164365758518632670, 43657174563782890110, 1987938667108592728530, 172494415819766906755890

Offset

1,1

Comments

A001221(a(n)) = n; A001414(a(n)) divides a(n). a(4) = 840; A086487(4) = 1122. This is probably the only difference between these two sequences.

Links

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

Example

a(4) = 840 = 2^3*3*5*7; 2+2+2+3+5+7 = 21 divides 840.

Crossrefs

Cf. A001414, A001221, A086487, A104465.

Sequence in context: A092177 A345762 A340534 * A086487 A071147 A156481

Adjacent sequences: A104463 A104464 A104465 * A104467 A104468 A104469

Keyword

nonn,less

Author

David Wasserman, Mar 09 2005

Status

approved