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.

A345532 Numbers that are the sum of eight cubes in two or more ways.

This page as a plain text file.
%I A345532 #7 Aug 05 2021 15:20:40
%S A345532 132,139,158,160,167,174,181,186,193,195,197,200,212,216,219,223,230,
%T A345532 237,238,244,249,251,256,258,263,265,270,272,275,277,282,284,286,288,
%U A345532 289,291,293,296,298,300,301,303,307,308,310,312,314,315,317,319,321,322
%N A345532 Numbers that are the sum of eight cubes in two or more ways.
%H A345532 Sean A. Irvine, <a href="/A345532/b345532.txt">Table of n, a(n) for n = 1..10000</a>
%e A345532 139 is a term because 139 = 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 1^3 + 2^3 + 4^3 = 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 2^3 + 3^3 + 3^3.
%o A345532 (Python)
%o A345532 from itertools import combinations_with_replacement as cwr
%o A345532 from collections import defaultdict
%o A345532 keep = defaultdict(lambda: 0)
%o A345532 power_terms = [x**3 for x in range(1, 1000)]
%o A345532 for pos in cwr(power_terms, 8):
%o A345532     tot = sum(pos)
%o A345532     keep[tot] += 1
%o A345532     rets = sorted([k for k, v in keep.items() if v >= 2])
%o A345532     for x in range(len(rets)):
%o A345532         print(rets[x])
%Y A345532 Cf. A003331, A345489, A345520, A345533, A345541, A345577, A345784.
%K A345532 nonn
%O A345532 1,1
%A A345532 _David Consiglio, Jr._, Jun 20 2021