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 A096967 #14 Jan 17 2016 04:17:52
%S A096967 0,2,4,7,11,17,26,37,54,76,106,145,199,266,357,472,621,809,1053,1354,
%T A096967 1740,2218,2818,3559,4485,5616,7018,8728,10826,13373,16484,20236,
%U A096967 24793,30275,36886,44810,54329,65683,79265,95419,114650,137447,164496,196445,234221
%N A096967 Bisection of A096441.
%C A096967 Number of partitions of 2n such that either all parts are odd or all parts are even, n >= 1. - _Omar E. Pol_, Aug 16 2013
%H A096967 Alois P. Heinz, <a href="/A096967/b096967.txt">Table of n, a(n) for n = 0..1000</a>
%p A096967 b:= proc(n, i) option remember; `if`(i>n, 0,
%p A096967 `if`(irem(n, i)=0, 1, 0)+add(`if`(irem(j, 2)=0,
%p A096967 b(n-i*j, i+1), 0), j=0..n/i))
%p A096967 end:
%p A096967 a:= n-> b(2*n, 1):
%p A096967 seq(a(n), n=0..60); # _Alois P. Heinz_, Mar 26 2014
%t A096967 b[n_, i_] := b[n, i] = If[i>n, 0, If[Mod[n, i]==0, 1, 0] + Sum[If[Mod[j, 2] ==0, b[n-i*j, i+1], 0], {j, 0, n/i}]]; a[n_] := b[2*n, 1]; Table[a[n], {n, 0, 60}] (* _Jean-François Alcover_, Jan 17 2016, after _Alois P. Heinz_ *)
%Y A096967 Cf. A096441, A078408.
%K A096967 nonn
%O A096967 0,2
%A A096967 _N. J. A. Sloane_, Aug 20 2004