cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A334354 The number of optimal sets of n distinct integers less than or equal to k with this property: the sum of every two members of this set divides the product of all the members of this set. An optimal set with this property is one whose greatest member is the least possible.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 3, 1, 2, 6, 1, 2, 5, 4, 1, 1, 1, 196, 115, 34, 4, 674, 303, 86, 14, 1, 852, 164, 19, 1, 1, 176, 19, 1, 1, 44503, 11396
Offset: 1

Views

Author

Zizheng Fang, Apr 24 2020

Keywords

Examples

			n=1:
1
n=2:
3, 6
3*6 = 18
3+6 divides 18
n=3:
3, 12, 15
3*12*15 = 540
3+12 divides 540
3+15 divides 540
12+15 divides 540
n=4:
2, 6, 10, 14
2*6*10*14 = 1680
2+6 divides 1680
2+10 divides 1680
2+14 divides 1680
6+10 divides 1680
6+14 divides 1680
10+14 divides 1680
n=5:
2, 6, 10, 14, 18
n=6:
2, 6, 10, 14, 18, 22
n=7:
2, 4, 10, 14, 18, 22, 26
2, 6, 10, 14, 18, 22, 26
4, 6, 10, 14, 18, 22, 26
n=8:
2, 4, 6, 10, 14, 18, 22, 26
n=9:
2, 6, 8, 10, 14, 18, 22, 26, 34
2, 6, 10, 14, 18, 22, 26, 30, 34
		

Crossrefs

Cf. A334352.
Showing 1-1 of 1 results.