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 A240015 #5 Mar 30 2014 17:26:20 %S A240015 1,0,1,1,2,2,4,4,7,8,12,14,21,24,33,41,53,66,84,104,130,162,198,246, %T A240015 300,369,445,548,655,801,956,1160,1378,1666,1970,2368,2796,3340,3933, %U A240015 4679,5494,6505,7626,8987,10511,12346,14404,16856,19631,22893,26606,30939 %N A240015 Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 6. %C A240015 With offset 12 number of partitions of n, where the difference between the number of odd parts and the number of even parts is -6. %H A240015 Alois P. Heinz, <a href="/A240015/b240015.txt">Table of n, a(n) for n = 6..1000</a> %p A240015 b:= proc(n, i, t) option remember; `if`(abs(t)>n, 0, %p A240015 `if`(n=0, 1, `if`(i<1, 0, b(n, i-1, t)+ %p A240015 `if`(i>n, 0, b(n-i, i, t+(2*irem(i, 2)-1)))))) %p A240015 end: %p A240015 a:= n-> b(n$2, -6): %p A240015 seq(a(n), n=6..80); %Y A240015 Column k=6 of A240009. %K A240015 nonn %O A240015 6,5 %A A240015 _Alois P. Heinz_, Mar 30 2014