cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A302917 #9 Apr 16 2018 18:56:46
%S A302917 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,
%T A302917 -6,-6,19,-8,-25,25,20,-12,-34,2,30,38,-117,54,159,-173,-123,55,229,
%U A302917 32,-250,-148,753,-365,-1022,840,1121,-847,-1482,-390,2099
%N 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.
%C A302917 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).
%t A302917 a[n_]:=a[n]=If[n===1,1,0]-Sum[Times@@a/@y,{y,Rest[Select[IntegerPartitions[n],Or[Length[#]===1,GCD@@#===1]&]]}];
%t A302917 Array[a,20]
%Y A302917 Cf. A000837, A036987, A047966, A063834, A093637, A196545, A220418, A289501, A290261, A300486, A300863-A300866, A301462, A302094, A302915, A302916.
%K A302917 sign
%O A302917 1,22
%A A302917 _Gus Wiseman_, Apr 15 2018