A104465 -id:A104465 - cp's OEIS frontend

A086487 Smallest number with n prime divisors such that the sum of the prime divisors is also a divisor, or 0 if no such number exists.

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

Offset: 1

Amarnath Murthy, Jul 28 2003

nonn

First member of A086486 with n distinct prime factors. A001221(a(n)) = n; A008472(a(n)) divides a(n). - David Wasserman, Mar 09 2005

			a(3) = 30. The prime divisors of 30 are 2,3 and 5 and 2+3+5 = 10, divides 30.

Cf. A086486, A086488.

Cf. A001221, A008472, A104465, A104466.

More terms from David Wasserman, Mar 09 2005

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.

Original entry on oeis.org

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

Offset: 1

David Wasserman, Mar 09 2005

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.

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

Cf. A001414, A001221, A086487, A104465.

cp's OEIS Frontend

A086487 Smallest number with n prime divisors such that the sum of the prime divisors is also a divisor, or 0 if no such number exists.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions