|
|
A099501
|
|
Least number of members in a subset of integers in the interval [n^2+1, (n+1)^2-1] whose product is twice a square.
|
|
6
|
|
|
1, 1, 3, 1, 1, 2, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Granville and Selfridge conjecture that a(n) <= 3 for all n.
|
|
LINKS
|
|
|
EXAMPLE
|
a(5) = 1 because the interval [26,35] contains two sets of such integers ({32} and {27,28,30,35}) and the smallest set has 1 member.
|
|
MATHEMATICA
|
Needs["DiscreteMath`Combinatorica`"]; Table[lst=Range[n^2+1, (n+1)^2-1]; x=Times@@lst; {p, e}=Transpose[FactorInteger[x]]; Do[If[e[[i]]==1 && p[[i]]!=2, lst=DeleteCases[lst, _?(Mod[ #, p[[i]]]==0&)]], {i, Length[p]}]; k=1; found=False; While[ !found && k<=Length[lst], m=0; While[ !found && m<Binomial[Length[lst], k], ss=UnrankKSubset[m, k, lst]; x=Times@@ss; If[Mod[x, 2]==0 && IntegerQ[Sqrt[x/2]], found=True]; m++ ]; k++ ]; (*Print[{n, ss, x}]; *)Length[ss], {n, 150}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|