|
%I #21 Nov 30 2013 21:30:36
%S 0,0,0,0,1,1,3,5,7,12,19,25,37,56,72,102,138,187,246,330,422,563,721,
%T 931,1177,1523,1903,2421,3020,3797,4700,5875,7218,8956,10954,13474,
%U 16401,20083,24316,29576,35685,43179,51870,62490,74757,89666,106927,127687
%N Total number of parts that are not the smallest part in all partitions of n that do not contain 1 as a part.
%C Total number of parts that are not the smallest part in all partitions of the head of the last section of the set of partitions of n. For more information see A195820.
%H Alois P. Heinz, <a href="/A195821/b195821.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) = A138135(n) - A195820(n) = A138137(n) - A195820(n) - A000041(n-1).
%e For n = 8 the seven partitions of 8 that do not contain 1 as a part are:
%e . 8
%e . 4 + 4
%e . (5) + 3
%e . (6) + 2
%e . (3) + (3) + 2
%e . (4) + 2 + 2
%e . 2 + 2 + 2 + 2
%e Note that in every partition the parts that are not the smallest part are shown between parentheses. The total number of parts that are not the smallest part is 0+0+1+1+2+1+0 = 5, so a(8) = 5.
%Y Cf. A000041, A000070, A002865, A092269, A135010, A138121, A138135, A138137, A182984, A195820.
%K nonn
%O 1,7
%A _Omar E. Pol_, Oct 19 2011
|
