3,2

a(n) is the number of triples (a,b,c) with b+c > a >= b >=c > 0 such that three disjoint subsets A,B,C of {1,2,...,n} with respective element sums a,b,c exist.

a(n) is also the number of partitions as counted in A160438 with additional constraint that there are only three parts and these fulfill the trianghle inequality.

H. v. Eitzen, Table of n, a(n) for n=3..10000

"AI", (Sci.math thread that inspired investigating the sequence)

H. v. Eitzen, How to Build Triangles from Integers

If n<=2, a(n)=0 trivially because three edges need at least three rods.

If n>=4, then a(n) = A005044(n*(n+1)/2), i.e. for n big enough all triangles of suitable perimeter can be obtained.

For n=3, only one integer sided triangle with perimeter 1+2+3=6 exists, namely (2,2,2). This cannot be built from rods of length 1,2 and 3. Therefore a(3)=0.

For n=4, two triangles with perimeter 1+2+3+4=10 exist: (4,4,2) and (4,3,3); both can be built from the available rods: (4,1+3,2) and (4,3,1+2). Therefore a(4)=2.

A002623 is a similar problem where one rod per edge is to be used.

Sequence in context: A126343 A049409 A006143 this_sequence A045929 A105501 A016873

Adjacent sequences: A160452 A160453 A160454 this_sequence A160456 A160457 A160458

easy,nonn

Hagen von Eitzen (math(AT)von-eitzen.de), May 14 2009