login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A362802 a(n) is the number of ways in which the set of divisors of n can be partitioned into disjoint parts, all of length > 1 and with integer harmonic mean. 2
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 4, 0, 0, 0, 1, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 15, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 175, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 78, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 188, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,24
LINKS
FORMULA
a(A362801(n)) > 0.
EXAMPLE
n a(n) partitions
== ==== ==========
6 1 {{1, 2, 3, 6}}
12 1 {{1, 2, 3, 6}, {4, 12}}
24 4 {{1, 2, 3, 6}, {4, 8, 12, 24}}, {{1, 2, 4, 8, 12, 24}, {3, 6}},
{{1, 3, 6}, {2, 4, 8, 12, 24}}, {{1, 2, 3, 6}, {4, 12}, {8, 24}}
MATHEMATICA
harmQ[s_] := AllTrue[s, Length[#] > 1 && IntegerQ[HarmonicMean[#]] &]; a[n_] := Module[{d = Divisors[n], r}, r = ResourceFunction["SetPartitions"][d]; Count[r, _?harmQ]]; Array[a, 119]
CROSSREFS
Cf. A339453, A339665, A362801, A362803 (indices of records).
Sequence in context: A228368 A267701 A128975 * A245817 A343316 A277115
KEYWORD
nonn
AUTHOR
Amiram Eldar, May 04 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 3 12:13 EDT 2024. Contains 372209 sequences. (Running on oeis4.)