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.

A202239 n such that the sum of the factorials of the digits of n equals the sum of d|n, 1

This page as a plain text file.
%I A202239 #22 Aug 09 2015 01:07:23
%S A202239 620,13407,66061,266533,282401,416641,3507607,7036153,7622243,
%T A202239 10327663,17735167,34802143,57653483,86357113,86546363,91203611,
%U A202239 112777747,121825337,124283381,127316869,176080309,216687451,218172511,231811037,243238447,263364883,272368301
%N A202239 n such that the sum of the factorials of the digits of n equals the sum of d|n, 1<d<n.
%F A202239 {n: A061602(n)= A048050(n)}. - _R. J. Mathar_, Dec 18 2011
%e A202239 620 is in the sequence because 6! + 2! + 0!  = 720 + 2 + 1 = 723, and sum of the divisors 1< d< n = sigma(620) - n - 1 = 1344 - 620 - 1 = 723.
%p A202239 isA202239 := proc(n)
%p A202239         A061602(n) = A048050(n) ;
%p A202239 end proc:
%p A202239 for n from 1 do
%p A202239         if isA202239(n) then
%p A202239         print(n) ;
%p A202239         end if;
%p A202239 end do; # _R. J. Mathar_, Dec 18 2011
%t A202239 Q[n_]:=Module[{a=Total[Rest[Most[Divisors[n]]]]}, a == Total[IntegerDigits[n]!]]; Select[Range[2, 10^8], Q]
%Y A202239 Cf. A000142, A061602, A048050.
%K A202239 nonn,base
%O A202239 1,1
%A A202239 _Michel Lagneau_, Dec 16 2011
%E A202239 a(17)-a(27) from _Donovan Johnson_, Jan 14 2012