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 A207032 #27 Oct 26 2024 02:51:49
%S A207032 1,1,1,3,0,1,3,3,0,1,7,1,2,0,1,9,6,2,2,0,1,15,4,4,1,2,0,1,19,13,4,5,1,
%T A207032 2,0,1,32,10,10,3,4,1,2,0,1,40,24,10,9,4,4,1,2,0,1,60,23,18,8,8,3,4,1,
%U A207032 2,0,1,78,46,22,19,8,9,3,4,1,2,0,1
%N A207032 Triangle read by rows: T(n,k) = number of odd/even parts >= k in the last section of the set of partitions of n, if k is odd/even.
%C A207032 For the calculation of row n, the number of odd/even parts, etc, take the row n from the triangle A207031 and then follow the same rules of A206563.
%F A207032 It appears that T(n,k) = abs(Sum_{j=k..n} (-1)^j*A207031(n,j)).
%F A207032 It appears that A182703(n,k) = T(n,k) - T(n,k+2). - Omar E. Pol, Feb 26 2012
%e A207032 Triangle begins:
%e A207032 1;
%e A207032 1, 1;
%e A207032 3, 0, 1;
%e A207032 3, 3, 0, 1;
%e A207032 7, 1, 2, 0, 1;
%e A207032 9, 6, 2, 2, 0, 1;
%e A207032 15, 4, 4, 1, 2, 0, 1;
%e A207032 19, 13, 4, 5, 1, 2, 0, 1;
%e A207032 32, 10, 10, 3, 4, 1, 2, 0, 1;
%e A207032 40, 24, 10, 9, 4, 4, 1, 2, 0, 1;
%e A207032 60, 23, 18, 8, 8, 3, 4, 1, 2, 0, 1;
%e A207032 78, 46, 22, 19, 8, 9, 3, 4, 1, 2, 0, 1;
%Y A207032 Cf. A006128, A066897, A066898, A135010, A138121, A138135, A138137, A141285, A181187, A182703, A206563, A207031.
%K A207032 nonn,tabl
%O A207032 1,4
%A A207032 _Omar E. Pol_, Feb 17 2012