A025058 - OEIS

%I #18 Nov 14 2021 10:09:04

%S 11,14,17,19,20,23,23,26,26,27,29,29,31,31,32,34,35,35,36,38,38,39,39,

%T 41,41,41,43,44,44,44,46,47,47,47,47,49,50,50,51,51,52,53,53,54,54,55,

%U 55,56,56,56,59,59,59,59,59,61,61,62,62,62,63,63,64,65,65

%N Numbers of form i*j + j*k + k*i, where 1 <=i < j < k, including repetitions.

%H Bo Gyu Jeong, <a href="/A025058/b025058.txt">Table of n, a(n) for n = 1..2000</a>

%e 11 is in the sequence because 11 = 1*2 + 2*3 + 3*1.

%e 23 appears twice because 23 = 1*3 + 3*5 + 5*1 = 1*2 + 2*7 + 7*1.

%o (Python)

%o def aupto(N):

%o     alst = []

%o     for i in range(1, N-1):

%o         for j in range(i+1, N//i + 1):

%o             p, s = i*j, i+j

%o             for k in range(j+1, (N-p)//s + 1):

%o                 alst.append(p + s*k)

%o     return sorted(alst)

%o print(aupto(65)) # _Michael S. Branicky_, Nov 14 2021

%Y Cf. A025060 (without repetitions), A093669.

%K nonn

%O 1,1

%A _Clark Kimberling_