Number of distinct terms in rows 0 through n of Pascal's triangle

[JEREMY GARDINER]

  Cf. A039825  Floor( (n^2+n+8) / 4 )
   
  2, 3, 5, 7, 9, 12, 16, 20, 24, 29, 35, 41, 47, 54, 62, 70, 78, 87, 97, 107, 117, 128, 140, 152, 164, 177, 191, 205, 219, 234, 250, 266, 282, 299, 317, 335, 353, 372, 392, 412, 432, 453, 475, 497, 519, 542, 566, 590, 614, 639 

Jeremy Gardiner
  -----------------------------------------------------------------------
Nick Hobson <nickh at qbyte.org> wrote:
  Is this an interesting sequence: 1, 1, 2, 3, 5, 7, 9, 12, 16, 20, 24, 29, 
35, 41, 48, 53, 60, 68, 77, 86, 95, 103, 114, 125, 137, 149, 162, 175, 
188, 202, 217, 232, 248, 264, 281, 297, 314, 332, 351, 370, 390, 410, 431, 
452, 474, 495, 518, 541, 565, 589, 614, 639, 665, 691, 718, 744, 770, 798, 
... ?

An easy upper bound is 1 + floor(n^2/4) = A033638(n). 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20061222/6ffdb3a7/attachment-0002.htm>