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.

A194714 Sum of all odd-indexed parts minus the sum of all even-indexed parts of all partitions of n, with the parts written in nondecreasing order.

This page as a plain text file.
%I A194714 #21 May 23 2012 09:38:49
%S A194714 1,2,3,4,5,8,9,14,18,26,32,48,57,82,102,138,169,230,278,370,450,584,
%T A194714 709,914,1102,1400,1692,2124,2555,3186,3818,4720,5649,6926,8269,10078,
%U A194714 11989,14526,17249,20782,24603,29508,34843,41600,49008,58258,68468,81098
%N A194714 Sum of all odd-indexed parts minus the sum of all even-indexed parts of all partitions of n, with the parts written in nondecreasing order.
%C A194714 It appears that A066897 is also another version of this sequence but with the parts written in nonincreasing order.
%H A194714 Alois P. Heinz, <a href="/A194714/b194714.txt">Table of n, a(n) for n = 1..1000</a>
%e A194714 a(6) = 37 - 29 = 8 because the partitions of 6 written in nondecreasing order are
%e A194714 .
%e A194714 .   6                        =  6
%e A194714 .   3  - 3                   =  0
%e A194714 .   2  - 4                   = -2
%e A194714 .   2  - 2  + 2              =  2
%e A194714 .   1  - 5                   = -4
%e A194714 .   1  - 2  + 3              =  2
%e A194714 .   1  - 1  + 4              =  4
%e A194714 .   1  - 1  + 2 - 2          =  0
%e A194714 .   1  - 1  + 1 - 3          = -2
%e A194714 .   1  - 1  + 1 - 1 + 2      =  2
%e A194714 .   1  - 1  + 1 - 1 + 1 - 1  =  0
%e A194714 ----------------------------------
%e A194714 .  20 - 21 + 14 - 7 + 3 - 1  =  8
%Y A194714 Cf. A066897, A135010, A138121, A141285, A194853.
%K A194714 nonn
%O A194714 1,2
%A A194714 _Omar E. Pol_, Feb 12 2012
%E A194714 More terms from _Alois P. Heinz_, Feb 12 2012