login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A215849
Numbers that are 1 more or less than the sum of the factorials of their digits.
0
1466, 81368, 372970, 372973
OFFSET
1,1
REFERENCES
Boris A. Kordemsky, The Moscow Puzzles (1972) at pp. 167, 295.
EXAMPLE
81368 = 8! + 1! + 3! + 6! + 8! + 1 = 40320 + 1 + 6 + 720 + 40320 + 1.
MATHEMATICA
fdQ[n_]:=Module[{c=Total[IntegerDigits[n]!]}, n==c+1||n==c-1]; Select[Range[400000], fdQ]
CROSSREFS
Sequence in context: A207988 A207220 A045012 * A204871 A252578 A083526
KEYWORD
nonn,fini,full,base
AUTHOR
Harvey P. Dale, Aug 24 2012
STATUS
approved