login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A187092
Number of nonempty subsets S of {1, 2, ..., n} with pairwise coprime elements that are maximal with respect to inclusion of elements < max(S).
1
1, 2, 3, 4, 6, 7, 9, 10, 13, 15, 21, 22, 28, 30, 33, 35, 43, 44, 52, 54, 58, 60, 68, 69, 77, 81, 89, 95, 119, 120, 144, 150, 160, 166, 181, 183, 213, 219, 229, 232, 262, 264, 294, 300, 305, 311, 341, 343, 373, 379, 399, 411, 471, 475, 505, 511, 531
OFFSET
1,2
LINKS
EXAMPLE
a(8) = 10; all nonempty subsets S of {1, 2, ..., 8} with pairwise coprime elements that are maximal with respect to inclusion of elements < max(S) are: {1}, {1,2}, {1,2,3}, {1,3,4}, {1,5,6}, {1,2,3,5}, {1,3,4,5}, {1,2,3,5,7}, {1,3,4,5,7}, {1,3,5,7,8}.
MAPLE
with(numtheory):
b:= n-> mul(ilog[j](n), j={ithprime(i)$i=1..pi(n)} minus factorset(n)):
a:= proc(n) option remember; b(n) +`if`(n<2, 0, a(n-1)) end:
seq(a(n), n=1..80);
MATHEMATICA
b[n_] := Product[Log[p, n] // Floor, {p, Select[Range[n-1], PrimeQ[#] && GCD[n, #] == 1&]}];
A187092 = Array[b, 100] // Accumulate (* Jean-François Alcover, Mar 27 2017, adapted from Maple *)
CROSSREFS
Partial sums of A186994.
Sequence in context: A088572 A366972 A071689 * A076679 A339509 A060233
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Mar 04 2011
STATUS
approved