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.
%I A051760 #14 Jan 31 2019 19:59:26
%S A051760 1,8,27,32,128,729
%N A051760 Numbers that are simultaneously a sum of distinct factorials and of the form a^b with b >= 3.
%C A051760 No further terms up to 10^18. - _Robert Israel_, Jan 30 2019
%e A051760 2! + 3! = 2^3;
%e A051760 1! + 2! + 4! = 3^3;
%e A051760 2! + 3! + 4! = 2^5;
%e A051760 2! + 3! + 5! = 2^7;
%e A051760 1! + 2! + 3! + 6! = 3^6 = 9^3.
%p A051760 N:= 10^5; # to get all terms <= N
%p A051760 S:= {1}:
%p A051760 for n from 2 do
%p A051760 v:= n!;
%p A051760 if v > N then break fi;
%p A051760 S:= S union {v} union map(`+`,S,v)
%p A051760 od:
%p A051760 filter:= proc(n) local F;
%p A051760 F:= ifactors(n)[2];
%p A051760 igcd(op(map(t ->t[2],F))) >= 3
%p A051760 end proc:
%p A051760 filter(1):= true:
%p A051760 select(filter, S); # _Robert Israel_, Jan 30 2019
%Y A051760 Cf. A025494, A051761.
%K A051760 nonn,more
%O A051760 1,2
%A A051760 Paul.Jobling(AT)WhiteCross.com, Aug 10 2000