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