|
%I #19 Dec 27 2021 08:25:40
%S 12,27,42,57,72,92,107,122,137,152,172,187,192,202,217,232,252,267,
%T 282,297,312,332,347,362,377,392,412,427,432,442,457,472,492,497,507,
%U 522,537,552,572,587,602,617,636,652,667,672,682,697,716,732,747,762
%N Sum of 12 but no fewer nonzero fourth powers.
%H David A. Corneth, <a href="/A047723/b047723.txt">Table of n, a(n) for n = 1..13916</a> (terms <= 200000)
%o (Python)
%o from itertools import count, takewhile, combinations_with_replacement as mc
%o def aupto(limit):
%o qd = list(takewhile(lambda x: x <= limit, (k**4 for k in count(1))))
%o ss = [set(sum(c) for c in mc(qd, i)) for i in range(13)]
%o for i in range(11, 0, -1): ss[12] -= ss[i]
%o return sorted(s for s in ss[12] if s <= limit)
%o print(aupto(762)) # _Michael S. Branicky_, Dec 27 2021
%Y Cf. A000583, A002377, A003346, A046044.
%K nonn
%O 1,1
%A Arlin Anderson (starship1(AT)gmail.com)
%E Typo in data corrected by _D. S. McNeil_, Aug 17 2010
|
