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.

A373243 a(n) = sum for all integer partitions of n of the difference between number of different parts and number of different multiplicities.

This page as a plain text file.
%I A373243 #12 May 30 2024 06:59:54
%S A373243 0,0,1,1,2,5,6,11,18,27,36,61,77,115,161,223,291,416,531,729,951,1256,
%T A373243 1605,2132,2694,3491,4423,5659,7079,9027,11201,14102,17484,21789,
%U A373243 26822,33309,40734,50160,61195,74893,90846,110722,133697,162026,195104,235244
%N A373243 a(n) = sum for all integer partitions of n of the difference between number of different parts and number of different multiplicities.
%C A373243 Sum of the rows of A373241 or A373242.
%e A373243 From the eighth row of A373241: a(8)=11
%e A373243   0, 1, 1, 0, 1, 2, 0, 0, 2, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0
%e A373243 or the tenth row of A373242: a(10)=27
%e A373243   0, 4, 8, 8, 5, 1, 1, 0, 0, 0
%t A373243 Table[Plus @@
%t A373243   Table[Plus @@
%t A373243     Map[Length[Union[#]] - Length[Union[Length /@ Split[#]]] &,
%t A373243      IntegerPartitions[n, {k}]], {k, 1, n}], {n, 1, 40}]
%Y A373243 Cf. A373241, A373242.
%K A373243 nonn
%O A373243 1,5
%A A373243 _Olivier Gérard_, May 29 2024