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.

A059589 Sums of factorials of distinct integers.

This page as a plain text file.
%I A059589 #25 Apr 15 2017 09:48:10
%S A059589 1,2,3,4,6,7,8,9,10,24,25,26,27,28,30,31,32,33,34,120,121,122,123,124,
%T A059589 126,127,128,129,130,144,145,146,147,148,150,151,152,153,154,720,721,
%U A059589 722,723,724,726,727,728,729,730,744,745,746,747,748,750,751,752,753
%N A059589 Sums of factorials of distinct integers.
%C A059589 0! and 1! are treated as distinct.
%C A059589 From _Bernard Schott_, Apr 13 2017: (Start)
%C A059589 Factorial numbers (A000142) are included in this sequence.
%C A059589 Only one factorial (2!) is the sum of distinct factorials in more than one way: 2! = 0! + 1!.
%C A059589 (End)
%C A059589 Sequence contains the same nonzero terms as A059590, and in addition also each term immediately after each maximal run of consecutive terms in A059590. For example, because A059590 contains numbers 30, 31, 32, 33, this sequence contains the same four terms, and also 34 which follows them but is not included in A059590. - _Antti Karttunen_, Apr 15 2017
%H A059589 Ivan Neretin, <a href="/A059589/b059589.txt">Table of n, a(n) for n = 1..10000</a>
%e A059589 128 is in the sequence since 5! + 3! + 2! = 128.
%e A059589 2 = 0! + 1!.
%t A059589 Rest@Union[Plus @@@ (Subsets@Range[0, 6]!)] (* _Ivan Neretin_, Jun 05 2016 *)
%Y A059589 Cf. A000142, A059590 (subsequences).
%Y A059589 Cf. A014597, A025494, A051760, A051761.
%K A059589 nonn
%O A059589 1,2
%A A059589 _Henry Bottomley_, Jan 24 2001