# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a116902
Showing 1-1 of 1

%I A116902 #15 Jan 24 2021 05:52:37
%S A116902 0,0,0,0,1,2,2,3,4,6,8,10,13,16,20,23,32,36,46,55,66,78,99,108,136,
%T A116902 160,188,216,271,296,364,415,484,559,684,725,890,1028,1175,1313,1599,
%U A116902 1727,2084,2335,2636,3019,3620,3801,4553,5170,5819,6460,7690,8265,9728,10783
%N A116902 Number of partitions of n into at least two parts such that the product of largest and smallest part exceeds n.
%H A116902 Fausto A. C. Cariboni, <a href="/A116902/b116902.txt">Table of n, a(n) for n = 1..200</a>
%e A116902 a(9)=4 since property holds for 4 partitions of 9: {7,2}, {6,3}, {5,4}, {5,2,2}.
%t A116902 fun[n_]:=Select[IntegerPartitions[n], (Length[ # ]>1 && Last[ # ]First[ # ]>n)&]; Table[Length[fun[k]],{k,40}]
%t A116902 (* second program: *)
%t A116902 A[n_] := Length@ Select[ IntegerPartitions@n, Length@# > 1 && Last@# First@# > n &]; Array[A, 56] (* _Robert G. Wilson v_, Apr 06 2006 *)
%Y A116902 Cf. A000041, A116900, A116901.
%K A116902 nonn
%O A116902 1,6
%A A116902 _Giovanni Resta_, Mar 14 2006
%E A116902 More terms from _Robert G. Wilson v_, Apr 06 2006

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE