The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A086191 Number of partitions of primes into mutual coprimes > 1. 0
1, 1, 2, 3, 5, 6, 9, 11, 18, 30, 34, 56, 78, 87, 125, 182, 263, 279, 402, 520, 565, 773, 987, 1328, 1878, 2332, 2485, 3092, 3235, 3999, 6957, 8396, 10734, 11228, 16920, 17703, 22237, 27589, 32577, 40187, 49227, 51427, 73453, 76998, 89430, 93452 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
a(n) = A007359(A000040(n)).
LINKS
EXAMPLE
n=10: A000040(10) = 29 = 27+2 = 26+3 = 25+4 = 24+5 = 23+6 = 22+7
= 21+8 = 20+9 = 19+10 = 19+7+3 = 19+5+3+2 = 18+11 = 17+12 = 17+7+5 =
17+7+3+2 = 17+5+4+3 = 16+13 = 15+14 = 15+7+4+3 = 13+11+5 = 13+11+3+2 =
13+9+7 = 13+9+5+2 = 13+7+5+4 = 11+9+7+2 = 11+9+5+4 = 11+8+7+3 = 11+7+6+5 =
9+8+7+5: a(10)=30.
MATHEMATICA
b[n_, i_, s_] := b[n, i, s] = Module[{f}, If[n == 0 || i == 1, 1, If[i<2, 0, f = FactorInteger[i][[All, 1]]; b[n, i-1, Select[s, #<i&]] + If[i <= n && f~Intersection~s == {}, b[n-i, i-1, Select[s~Union~f, #<i&]], 0]]]];
c[n_] := b[n, n, {}] - b[n-1, n-1, {}];
a[n_] := c[Prime[n]];
Table[Print[n, " ", a[n]]; a[n]; a[n], {n, 1, 60}] (* Jean-François Alcover, Oct 06 2021, after Alois P. Heinz in A007359 *)
CROSSREFS
Sequence in context: A227070 A032718 A366143 * A074658 A186106 A329161
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Aug 27 2003
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 13 08:41 EDT 2024. Contains 372498 sequences. (Running on oeis4.)