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 A130687 #9 Aug 24 2015 02:36:36
%S A130687 1,14,15,17,22,40,41,45,50,51,54,70,71,102,112,120,121,123,132,144,
%T A130687 156,165,200,201,203,210,211,213,230,231,302,312,320,321,334,343,404,
%U A130687 414,433,440,441,457,475,506,516,547,560,561,574,605,615
%N A130687 Numbers n such that a_1! + a_2! + ... + a_m! is a square number, where a_1a_2...a_m is the decimal expansion of n.
%F A130687 A010052(A061602(a(n)))=1. - _R. J. Mathar_, Jul 12 2007
%e A130687 1! + 4! = 4! + 1! = 5^2, hence 14 and 41 are in the sequence.
%p A130687 A061602 := proc(n) local digs ; digs := convert(n,base,10) ; add(factorial(op(i,digs)),i=1..nops(digs)) ; end: isA130687 := proc(n) issqr(A061602(n)) ; end: for n from 1 to 3000 do if isA130687(n) then printf("%d, ",n) ; fi ; od ; # _R. J. Mathar_, Jul 12 2007
%t A130687 Select[Range[755], IntegerQ[Sqrt[DigitCount[ # ][[10]]+Sum[DigitCount[ # ][[i]]*i!, {i, 1, 9}]]] &]
%K A130687 base,nonn
%O A130687 1,2
%A A130687 _Yalcin Aktar_, Jun 30 2007
%E A130687 Edited by _Stefan Steinerberger_ and _R. J. Mathar_, Jul 12 2007