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!)
A302917 Solution to a(1) = 1 and Sum_y Product_i a(y_i) = 0 for each n > 1, where the sum is over all relatively prime or monic partitions of n. 4
1, -1, 0, 0, -1, 0, 0, 0, 0, 0, -1, 1, -1, -1, 1, 1, -1, -1, 0, 1, 1, -3, 1, 4, -5, -3, 3, 4, 2, -6, -6, 19, -8, -25, 25, 20, -12, -34, 2, 30, 38, -117, 54, 159, -173, -123, 55, 229, 32, -250, -148, 753, -365, -1022, 840, 1121, -847, -1482, -390, 2099 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,22
COMMENTS
A relatively prime or monic partition of n is an integer partition of n that is either of length 1 (monic) or whose parts have no common divisor other than 1 (relatively prime).
LINKS
MATHEMATICA
a[n_]:=a[n]=If[n===1, 1, 0]-Sum[Times@@a/@y, {y, Rest[Select[IntegerPartitions[n], Or[Length[#]===1, GCD@@#===1]&]]}];
Array[a, 20]
CROSSREFS
Sequence in context: A319649 A198553 A324288 * A069203 A046070 A068399
KEYWORD
sign
AUTHOR
Gus Wiseman, Apr 15 2018
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 July 11 19:26 EDT 2024. Contains 374234 sequences. (Running on oeis4.)