|
Search: id:A076413
|
|
|
| A076413 |
|
Number of ways n is expressible as the least common multiple of a nonempty set of positive integers not containing either 1 or n. |
|
+0
2
|
|
| 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 6, 0, 1, 1, 0, 0, 6, 0, 6, 1, 1, 0, 28, 0, 1, 0, 6, 0, 45, 0, 0, 1, 1, 1, 72, 0, 1, 1, 28, 0, 45, 0, 6, 6, 1, 0, 120, 0, 6, 1, 6, 0, 28, 1, 28, 1, 1, 0, 850, 0, 1, 6, 0, 1, 45, 0, 6, 1, 45, 0, 672, 0, 1, 6, 6, 1, 45, 0, 120, 0, 1, 0, 850, 1, 1, 1, 28, 0, 850, 1, 6, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,12
|
|
|
FORMULA
|
a(n) = A076078(n)/2 - 2^(d(n)-2), where d(n)=A000005(n) is the number of divisors of n.
|
|
EXAMPLE
|
a(12)=6; the 6 sets are: {3,4}, {4,6}, {2,3,4}, {2,4,6}, {3,4,6}, {2,3,4,6}.
|
|
MATHEMATICA
|
a076078[n_] := Module[{d, i}, d=Divisors[n]; Sum[MoebiusMu[n/d[[i]]]*(2^DivisorSigma[0, d[[i]]]-1), {i, 1, Length[d]}]]; a[n_] := a076078[n]/2-2^(DivisorSigma[0, n]-2)
|
|
CROSSREFS
|
Cf. A076078.
Sequence in context: A051626 A137785 A134899 this_sequence A154305 A158781 A063085
Adjacent sequences: A076410 A076411 A076412 this_sequence A076414 A076415 A076416
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com) and Dean Hickerson (dean.hickerson(AT)yahoo.com), Oct 09 2002
|
|
|
Search completed in 0.002 seconds
|
