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.
%I A300862 #8 Mar 14 2018 21:21:19
%S A300862 1,1,0,0,-1,-1,0,1,1,0,-2,-3,-2,2,7,6,-3,-15,-19,-2,32,54,24,-64,-153,
%T A300862 -123,95,389,444,-43,-966,-1475,-516,2066,4414,3092,-3874,-12480,
%U A300862 -12936,3847,32445,45494,8950,-77282,-147663,-86313,157456,435623,399041,-229616,-1211479,-1535700,-73132
%N A300862 Solution to 1 = Sum_y Product_{k in y} a(k) for each n > 0, where the sum is over all integer partitions of n with an odd number of parts.
%t A300862 a[n_]:=a[n]=1-Sum[Times@@a/@y,{y,Select[IntegerPartitions[n],Length[#]>1&&OddQ[Length[#]]&]}];
%t A300862 Array[a,40]
%Y A300862 Cf. A027193, A063834, A220418, A279374, A290261, A290971, A298118, A299202, A299203, A300301, A300436, A300439, A300863, A300864, A300865, A300866.
%K A300862 sign
%O A300862 1,11
%A A300862 _Gus Wiseman_, Mar 13 2018