cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

11, 14, 17, 19, 20, 23, 23, 26, 26, 27, 29, 29, 31, 31, 32, 34, 35, 35, 36, 38, 38, 39, 39, 41, 41, 41, 43, 44, 44, 44, 46, 47, 47, 47, 47, 49, 50, 50, 51, 51, 52, 53, 53, 54, 54, 55, 55, 56, 56, 56, 59, 59, 59, 59, 59, 61, 61, 62, 62, 62, 63, 63, 64, 65, 65
Offset: 1

Views

Author

Keywords

Examples

			11 is in the sequence because 11 = 1*2 + 2*3 + 3*1.
23 appears twice because 23 = 1*3 + 3*5 + 5*1 = 1*2 + 2*7 + 7*1.
		

Crossrefs

Cf. A025060 (without repetitions), A093669.

Programs

  • Python
    def aupto(N):
        alst = []
        for i in range(1, N-1):
            for j in range(i+1, N//i + 1):
                p, s = i*j, i+j
                for k in range(j+1, (N-p)//s + 1):
                    alst.append(p + s*k)
        return sorted(alst)
    print(aupto(65)) # Michael S. Branicky, Nov 14 2021