login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116902 Number of partitions of n into at least two parts such that the product of largest and smallest part exceeds n. 3

%I #15 Jan 24 2021 05:52:37

%S 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 160,188,216,271,296,364,415,484,559,684,725,890,1028,1175,1313,1599,

%U 1727,2084,2335,2636,3019,3620,3801,4553,5170,5819,6460,7690,8265,9728,10783

%N Number of partitions of n into at least two parts such that the product of largest and smallest part exceeds n.

%H Fausto A. C. Cariboni, <a href="/A116902/b116902.txt">Table of n, a(n) for n = 1..200</a>

%e a(9)=4 since property holds for 4 partitions of 9: {7,2}, {6,3}, {5,4}, {5,2,2}.

%t fun[n_]:=Select[IntegerPartitions[n], (Length[ # ]>1 && Last[ # ]First[ # ]>n)&]; Table[Length[fun[k]],{k,40}]

%t (* second program: *)

%t A[n_] := Length@ Select[ IntegerPartitions@n, Length@# > 1 && Last@# First@# > n &]; Array[A, 56] (* _Robert G. Wilson v_, Apr 06 2006 *)

%Y Cf. A000041, A116900, A116901.

%K nonn

%O 1,6

%A _Giovanni Resta_, Mar 14 2006

%E More terms from _Robert G. Wilson v_, Apr 06 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)