Let f(n) be smallest number k which is a sum of n distinct numbers whose LCM is a multiple of k. Sequence gives triangle read by rows in which n-th row consists of those n numbers (row 2 is 0, 0 by convention).

A081536

Let f(n) be smallest number k which is a sum of n distinct numbers whose LCM is a multiple of k. Sequence gives triangle read by rows in which n-th row consists of those n numbers (row 2 is 0, 0 by convention).

Terms

    a(0) =1a(1) =0a(2) =0a(3) =1a(4) =2a(5) =3a(6) =1a(7) =2a(8) =4a(9) =7a(10) =1a(11) =2a(12) =3a(13) =4a(14) =5a(15) =1a(16) =2a(17) =3a(18) =4a(19) =6a(20) =8a(21) =1a(22) =2a(23) =3a(24) =4a(25) =5a(26) =6a(27) =7a(28) =1a(29) =2

External references