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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A196719 Number of subsets of {1..n} (including empty set) such that the pairwise GCDs of elements are all distinct. 6

%I

%S 1,2,4,7,11,16,24,31,40,52,68,79,102,115,140,175,201,218,265,284,336,

%T 396,446,469,547,599,662,742,837,866,1034,1065,1153,1275,1370,1511,

%U 1719,1756,1869,2030,2244,2285,2613,2656,2865,3236,3394,3441,3780,3921,4232

%N Number of subsets of {1..n} (including empty set) such that the pairwise GCDs of elements are all distinct.

%H Fausto A. C. Cariboni, <a href="/A196719/b196719.txt">Table of n, a(n) for n = 0..1500</a> (terms 1..200 from Alois P. Heinz)

%e a(6) = 24: {}, {1}, {2}, {3}, {4}, {5}, {6}, {1,2}, {1,3}, {1,4}, {1,5}, {1,6}, {2,3}, {2,4}, {2,5}, {2,6}, {3,4}, {3,5}, {3,6}, {4,5}, {4,6}, {5,6}, {2,3,6}, {3,4,6}.

%p b:= proc(n, s) local sn, m;

%p m:= nops(s);

%p sn:= [s[], n];

%p `if`(n<1, 1, b(n-1, s) +`if`(m*(m+1)/2 = nops(({seq(seq(

%p igcd(sn[i], sn[j]), j=i+1..m+1), i=1..m)})), b(n-1, sn), 0))

%p end:

%p a:= proc(n) option remember;

%p b(n-1, [n]) +`if`(n=0, 0, a(n-1))

%p end:

%p seq(a(n), n=0..50);

%t b[n_, s_] := b[n, s] = With[{m = Length[s], sn = Append[s, n]}, If[n<1, 1, b[n-1, s] + If[m*(m+1)/2 == Length[ Union @ Flatten @ Table[ Table[ GCD[ sn[[i]], sn[[j]]], {j, i+1, m+1}], {i, 1, m}]], b[n-1, sn], 0]]];

%t a[n_] := a[n] = b[n-1, {n}] + If[n == 0, 0, a[n-1]];

%t Table[a[n], {n, 0, 50}] (* _Jean-Fran├žois Alcover_, Apr 06 2017, translated from Maple *)

%Y Cf. A143823, A196720, A196721, A196722, A196723, A196724.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Oct 05 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 22:15 EDT 2021. Contains 343992 sequences. (Running on oeis4.)