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 A271364 #12 Apr 05 2016 23:05:37 %S A271364 1,1,2,4,8,15,29,52,93,162,279,463,769,1236,1975,3100,4824,7358,11200, %T A271364 16706 %N A271364 Number of novel integer partitions whose parts sum to 2n. %C A271364 A novel integer partition is an integer partition with k parts with overall gcd 1 such that there are k-1 linearly independent ways to add up the parts with plus or minus signs and reach zero. %C A271364 For a novel integer partition, it is always possible to add up the parts with plus or minus signs and reach zero. For this reason, no odd number can be the sum of a novel partition. %H A271364 R. Arratia and S. DeSalvo, <a href="http://arxiv.org/abs/1105.2834">On the singularity of random Bernoulli matrices -- novel integer partitions and lower bound expansions</a>, arXiv:1105.2834 [math.PR], 2001-2012. %H A271364 R. Arratia and S. DeSalvo, <a href="http://dx.doi.org/10.1007/s00026-013-0176-7">On the singularity of random Bernoulli matrices -- novel integer partitions and lower bound expansions</a>, Annals of Combinatorics, 17(2) (2013), 251--274. %e A271364 111111 and 21111 are both novel partitions, and they both sum to 6. No other novel partition sums to 6, so, a(3)=2. %Y A271364 Cf. A270638. %K A271364 nonn,more %O A271364 1,3 %A A271364 _Nathan Fox_, Apr 05 2016