|
%I #11 Dec 15 2017 17:36:55
%S 0,13,65,379,2549,19480,159001,1345929,11676912,103136395
%N Number of admirable numbers < 10^n.
%t fQ[n_] := Block[{d = Most[Divisors[n]], k = 1}, l = Length[d]; s = Plus @@ d; While[k < l && s - 2d[[k]] > n, k++ ]; If[k > l || s != n + 2d[[k]], False, True]]; c = 0; k = 1; Do[ While[k <= 10^n, If[ fQ[k], c++ ]; k++ ]; k++; Print[c], {n, 7}] (* _Robert G. Wilson v_ *)
%Y Cf. A111592.
%K nonn
%O 1,2
%A _Jason Earls_, Aug 10 2005
%E a(7) from _Robert G. Wilson v_, Aug 13 2005
%E a(8)-a(10) from _Donovan Johnson_, Jan 25 2012
|
