login

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”).

A080511
Triangle whose n-th row contains the least set (ordered lexicographically) of n distinct positive integers whose arithmetic mean is an integer.
4
1, 1, 3, 1, 2, 3, 1, 2, 3, 6, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 9, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 12, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 15, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 18, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 21
OFFSET
1,3
COMMENTS
The n-th row is {1,2,...,n-1,x}, where x=n if n is odd, x=3n/2 if n is even.
EXAMPLE
Triangle starts:
1;
1, 3;
1, 2, 3;
1, 2, 3, 6;
1, 2, 3, 4, 5;
1, 2, 3, 4, 5, 9;
1, 2, 3, 4, 5, 6, 7;
1, 2, 3, 4, 5, 6, 7, 12;
...
MAPLE
T:= proc(n) $1..n-1, `if`(irem(n, 2)=1, n, 3*n/2) end:
seq(T(n), n=1..20); # Alois P. Heinz, Aug 29 2013
MATHEMATICA
row[n_] := Append[Range[n - 1], If[OddQ[n], n, 3 n/2]];
Table[row[n], {n, 1, 20}] // Flatten (* Jean-François Alcover, May 21 2016 *)
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Amarnath Murthy, Mar 20 2003
STATUS
approved