The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A285572 Number of finite sets of pairwise indivisible positive integers with least common multiple n. 75

%I

%S 1,1,1,1,1,2,1,1,1,2,1,3,1,2,2,1,1,3,1,3,2,2,1,4,1,2,1,3,1,9,1,1,2,2,

%T 2,6,1,2,2,4,1,9,1,3,3,2,1,5,1,3,2,3,1,4,2,4,2,2,1,23,1,2,3,1,2,9,1,3,

%U 2,9,1,10,1,2,3,3,2,9,1,5,1,2,1,23,2,2,2,4,1,23,2,3,2,2,2,6,1,3,3,6

%N Number of finite sets of pairwise indivisible positive integers with least common multiple n.

%H Michael De Vlieger, <a href="/A285572/b285572.txt">Table of n, a(n) for n = 1..10000</a>

%e The a(72)=10 sets are {72}, {8,9}, {8,18}, {8,36}, {9,24}, {18,24}, {24,36}, {6,8,9}, {8,9,12}, {8,12,18}.

%t nn=50;

%t stableSets[u_,Q_]:=If[Length[u]===0,{{}},With[{w=First[u]},Join[stableSets[DeleteCases[u,w],Q],Prepend[#,w]&/@stableSets[DeleteCases[u,r_/;r===w||Q[r,w]||Q[w,r]],Q]]]];

%t Table[Length[Select[Rest[stableSets[Divisors[n],Divisible]],LCM@@#===n&]],{n,1,nn}]

%Y Cf. A000666, A006126, A048143, A054921, A076078, A076413, A285573.

%K nonn

%O 1,6

%A _Gus Wiseman_, Apr 21 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 18 12:25 EDT 2021. Contains 345108 sequences. (Running on oeis4.)