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 A014080 #61 May 25 2025 09:24:55
%S A014080 1,2,145,40585
%N A014080 Factorions: equal to the sum of the factorials of their digits in base 10 (cf. A061602).
%C A014080 Poole (1971) showed that there are no further terms. - _N. J. A. Sloane_, Mar 17 2019
%C A014080 Base 6 also has four factorions, as does base 15. - _Alonso del Arte_, Oct 20 2012
%C A014080 This is row 10 of the table A193163. - _M. F. Hasler_, Nov 25 2015
%D A014080 J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 145, p. 50, Ellipses, Paris 2008.
%D A014080 P. Kiss, A generalization of a problem in number theory, Math. Sem. Notes Kobe Univ., 5 (1977), no. 3, 313-317. MR 0472667 (57 #12362).
%D A014080 Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see pp. 68, 305.
%D A014080 Alfred S. Posamentier, Math Charmers, Tantalizing Tidbits for the Mind, Prometheus Books, NY, 2003, pages 38, 62-63.
%D A014080 Joe Roberts, "The Lure of the Integers", page 35.
%D A014080 D. Wells, Curious and interesting numbers, Penguin Books, p. 125.
%H A014080 Project Euler, <a href="https://projecteuler.net/problem=34">Problem 34: Digit factorials</a>
%H A014080 P. Kiss, <a href="http://real-j.mtak.hu/9373/1/MTA_MatematikaiLapok_1974.pdf">A generalization of a problem in number theory</a>, [Hungarian], Mat. Lapok, 25 (No. 1-2, 1974), 145-149.
%H A014080 G. D. Poole, <a href="https://doi.org/10.1080/0025570X.1971.11976172">Integers and the sum of the factorials of their digits</a>, Math. Mag., 44 (1971), 278-279, <a href="https://www.jstor.org/stable/2688641">[JSTOR]</a>.
%H A014080 H. J. J. te Riele, <a href="https://ir.cwi.nl/pub/6662">Iteration of number-theoretic functions</a>, Nieuw Archief v. Wiskunde, (4) 1 (1983), 345-360. See Example I.1.b.
%H A014080 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Factorion.html">Factorion</a>
%F A014080 If n has digits (d1,d2,...,dk) base 10, then n is on this list if and only if n = d1! + d2! + ... + dk!.
%e A014080 1! + 4! + 5! = 1 + 24 + 120 = 145, so 145 is in the sequence.
%t A014080 Select[Range[50000], Plus @@ (IntegerDigits[ # ]!) == # &] (* _Alonso del Arte_, Jan 14 2008 *)
%o A014080 (J) (#~ (= +/@:!@:("."0)@":"0)) i.1e5 NB. _Stephen Makdisi_, May 14 2016
%o A014080 (Python)
%o A014080 from itertools import count, islice
%o A014080 def A014080_gen(): # generator of terms
%o A014080 return (n for n in count(1) if sum((1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880)[int(d)] for d in str(n)) == n)
%o A014080 A014080_list = list(islice(A014080_gen(),4)) # _Chai Wah Wu_, Feb 18 2022
%Y A014080 Cf. A061602, A193163, A214285, A254499, A306955.
%K A014080 nonn,fini,full,base
%O A014080 1,2
%A A014080 _David W. Wilson_