[seqfan] Re: definition of A002848

[Alois Heinz]

I have found a paper that seems to contain A002849,
but with a(14) = 204, instead of 202.  The title is quite
promising.

http://dx.doi.org/10.1016/0012-365X(94)90168-6

Nigel Martin: Solving a conjecture of Sedlacek:
   maximal edge sets in the 3-uniform sumset hypergraphs
   Discrete Mathematics, Volume 125, Issues 1-3,
   15 February 1994, Pages 273-277

1, 2, 4, 6, 3, 10, 25, 12, 42, 8, 40, 204, 21, 135, 1002,
4228, 720, 5134, 29546, 4079, 35533, 3040, 28777, 281504,
20505, 212283, 2352469, 16907265, 1669221

Alois

franktaw at netscape.net schrieb:
> Possibly (I haven't really checked, but the pattern is right) A002849 
> is the number of partitions of a subset of 1..n into triples X+Y=Z, 
> with the maximum possible number of such triples.  A002848 would then 
> be the number of such partitions that include n in one of the triples.
>
> If this is correct, I would argue that A002849(1) and A002849(2) should 
> both be 1, representing the empty partition.
>
> Franklin T. Adams-Watters
>
>