cp's OEIS Frontend

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.

A240019 Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 10.

This page as a plain text file.
%I A240019 #7 Mar 30 2014 20:12:51
%S A240019 1,0,1,1,2,2,4,4,7,8,12,14,21,24,34,41,55,66,88,105,137,165,209,253,
%T A240019 318,383,474,573,701,844,1027,1231,1487,1780,2134,2547,3041,3614,4294,
%U A240019 5092,6022,7117,8389,9882,11607,13638,15963,18702,21834,25504,29694,34600
%N A240019 Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 10.
%C A240019 With offset 20 number of partitions of n, where the difference between the number of odd parts and the number of even parts is -10.
%H A240019 Alois P. Heinz, <a href="/A240019/b240019.txt">Table of n, a(n) for n = 10..1000</a>
%e A240019 a(17) = 4: [6,1,1,1,1,1,1,1,1,1,1,1], [5,2,1,1,1,1,1,1,1,1,1,1], [4,3,1,1,1,1,1,1,1,1,1,1], [3,3,2,1,1,1,1,1,1,1,1,1].
%p A240019 b:= proc(n, i, t) option remember; `if`(abs(t)>n, 0,
%p A240019       `if`(n=0, 1, `if`(i<1, 0, b(n, i-1, t)+
%p A240019       `if`(i>n, 0, b(n-i, i, t+(2*irem(i, 2)-1))))))
%p A240019     end:
%p A240019 a:= n-> b(n$2, -10):
%p A240019 seq(a(n), n=10..80);
%Y A240019 Column k=10 of A240009.
%K A240019 nonn
%O A240019 10,5
%A A240019 _Alois P. Heinz_, Mar 30 2014