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.

A301593 n can be represented the sum of a(n) distinct factorials. (If there is no such representation, a(n) = 0.)

This page as a plain text file.
%I A301593 #33 Mar 26 2018 19:56:42
%S A301593 1,1,2,0,0,1,2,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,2,3,0,0,2,3,3,4,0,
%T A301593 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A301593 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A301593 n can be represented the sum of a(n) distinct factorials. (If there is no such representation, a(n) = 0.)
%H A301593 Seiichi Manyama, <a href="/A301593/b301593.txt">Table of n, a(n) for n = 1..10000</a>
%H A301593 Wikipedia, <a href="http://en.wikipedia.org/wiki/Factoradic">Factorial number system</a>
%F A301593 a(n!) = 1, a(n!+1) = 2.
%e A301593 n |                        | a(n)
%e A301593 --+------------------------+-----
%e A301593 1 | 1!                     |  1
%e A301593 2 | 2!                     |  1
%e A301593 3 | 1! + 2!                |  2
%e A301593 6 | 3!                     |  1
%e A301593 7 | 3! + 1!                |  2
%e A301593 8 | 3! + 2!                |  2
%e A301593 9 | 3! + 2! + 1!           |  3
%Y A301593 Cf. A000142, A007489, A038507, A059590, A108731, A115944, A301523.
%K A301593 nonn
%O A301593 1,3
%A A301593 _Seiichi Manyama_, Mar 24 2018