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 A236430 #10 Nov 06 2018 04:21:51
%S A236430 2,5,11,22,42,76,134,228,379,606,985,1528,2364,3576,5419,7988,11868,
%T A236430 17163,24937,35599,50787,71290,100748,139734,194113
%N A236430 Number of representations of 1 as a sum of numbers d*k with d in {-1,1} and k in {1,2,...,n}, where the sum of the numbers k is 2n + 1.
%C A236430 a(n) = number of partitions of 2n+1 that contain a partition of n+1.
%e A236430 a(2) counts these 5 representations of 1: 3-2, 3-1-1, 2+1-2, 2+1-1-1, 1+1+1-1-1.
%t A236430 p[n_] := p[n] = IntegerPartitions[n]; Map[({p1 = p[#], p2 = p[2 #]} &[#]; Length[Cases[p2, Apply[Alternatives, Map[Flatten[{___, #, ___}] &, p1]]]]) &, Range[12]]
%t A236430 Map[({p1 = p[# + 1], p2 = p[2 # + 1]} &[#]; Length[Cases[p2, Apply[Alternatives, Map[Flatten[{___, #, ___}] &, p1]]]]) &, Range[12]]
%t A236430 (* _Peter J. C. Moses_, Jan 04 2014 *)
%Y A236430 Cf. A236429, A235130.
%K A236430 nonn,more
%O A236430 1,1
%A A236430 _Clark Kimberling_, Jan 25 2014