A054064 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A054064

Least k for which the integers floor(2k/(m*(m+1))) for m=1,2,...,n are distinct.

1, 1, 3, 6, 12, 20, 45, 63, 84, 144, 180, 225, 330, 396, 468, 637, 735, 840, 1088, 1224, 1377, 1710, 1900, 2310, 2541, 2783, 3312, 3600, 3900, 4563, 4914, 5684, 6090, 6525, 7440, 7936, 8976, 9537, 10115, 11340, 11988

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

Table of n, a(n) for n=1..41.

CROSSREFS

Sequence in context: A028925 A028924 A034738 * A246866 A053479 A290768

Adjacent sequences: A054061 A054062 A054063 * A054065 A054066 A054067

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved