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 A239882 #8 Apr 01 2014 06:09:21
%S A239882 1,1,1,2,3,6,9,15,22,33,46,65,87,117,153,199,254,324,408,512,639,795,
%T A239882 986,1221,1509,1862,2298,2830,3485,4285,5267,6460,7920,9687,11836,
%U A239882 14426,17557,21310,25823,31204,37632,45262,54326,65029,77678,92549,110035,130509
%N A239882 Number of strict partitions of 2n having an ordering of the parts in which no two neighboring parts have the same parity.
%C A239882 a(n) = number of strict partitions (that is, every part has multiplicity 1) of 2n having an ordering of the parts in which no two neighboring parts have the same parity. This sequence is nondecreasing, unlike A239881, of which it is a bisection; the other bisection is A239883.
%H A239882 Alois P. Heinz, <a href="/A239882/b239882.txt">Table of n, a(n) for n = 0..500</a>
%e A239882 a(6) counts these 9 partitions of 12: [12], [9,2,1], [3,8,1], [7,4,1], [7,2,3], [5,6,1], [6,3,2,1], [5,4,3], [5,4,1,2]
%t A239882 d[n_] := Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; p[n_] := p[n] = Select[d[n], Abs[Count[#, _?OddQ] - Count[#, _?EvenQ]] <= 1 &]; t = Table[p[n], {n, 0, 12}]
%t A239882 TableForm[t] (* shows the partitions *)
%t A239882 u = Table[Length[p[2 n]], {n, 0, 40}] (* A239882 *)
%t A239882 (* _Peter J. C. Moses_, Mar 10 2014 *)
%Y A239882 Cf. A239881, A239883, A239872.
%K A239882 nonn,easy
%O A239882 0,4
%A A239882 _Clark Kimberling_, Mar 29 2014
%E A239882 More terms from _Alois P. Heinz_, Mar 31 2014