login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A109727
Number of admirable numbers < 10^n.
0
0, 13, 65, 379, 2549, 19480, 159001, 1345929, 11676912, 103136395
OFFSET
1,2
MATHEMATICA
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 *)
CROSSREFS
Cf. A111592.
Sequence in context: A147067 A147075 A268777 * A041320 A058380 A129746
KEYWORD
nonn
AUTHOR
Jason Earls, Aug 10 2005
EXTENSIONS
a(7) from Robert G. Wilson v, Aug 13 2005
a(8)-a(10) from Donovan Johnson, Jan 25 2012
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy