%I #24 Jul 06 2022 13:35:23
%S 1,1,2,3,5,7,11,13,20,26,33,41,55,63,77,93,111,129,160,180,209,240,
%T 280,312,356,397,453,498,560,614,680,758,831,901,994,1087,1179,1280,
%U 1389,1495,1629,1745,1868,2022,2159,2296,2485,2650,2809,2991,3181,3377,3600
%N Cardinality of the set of ordered pairs (m(lambda),f(lambda)), where lambda ranges over all partitions of n and m gives the infimum and f gives the sum of the squares of the argument.
%H Alois P. Heinz, <a href="/A354800/b354800.txt">Table of n, a(n) for n = 0..700</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Infimum_and_supremum#Infima_and_suprema_of_real_numbers">Infima and suprema of real numbers</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_(number_theory)">Partition (number theory)</a>
%e a(0) = 1 = |{(infinity,0)}|.
%e a(1) = 1 = |{(1,1)}|.
%e a(2) = 2 = |{(1,2), (2,4)}|.
%e a(3) = 3 = |{(1,3), (1,5), (3,9)}|.
%e a(4) = 5 = |{(1,4), (1,6), (1,10), (2,8), (4,16)}|.
%e a(5) = 7 = |{(1,5), (1,7), (1,9), (1,11), (1,17), (2,13), (5,25)}|.
%p a:= n-> nops({map(l-> [min(l), add(i^2, i=l)], combinat[partition](n))[]}):
%p seq(a(n), n=0..40);
%p # second Maple program:
%p b:= proc(n, i) option remember; `if`(n=0, {0}, `if`(n<i,
%p {}, {b(n, i+1)[], map(x-> x+i^2, b(n-i, i))[]}))
%p end:
%p a:= n-> add(nops(b(n-i, i)), i=signum(n)..n):
%p seq(a(n), n=0..60);
%t b[n_, i_] := b[n, i] = If[n == 0, {0}, If[n < i, {}, Union@ Flatten@ {b[n, i + 1], # + i^2& /@ b[n - i, i]}]];
%t a[n_] := Sum[Length[b[n - i, i]], {i, Sign[n], n}];
%t Table[a[n], {n, 0, 60}] (* _Jean-François Alcover_, Jul 06 2022, after _Alois P. Heinz_ *)
%Y Cf. A069999 (lower bound), A354468 (the same for supremum).
%K nonn
%O 0,3
%A _Alois P. Heinz_, Jun 06 2022