login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096311 Numbers n such that number of divisors = largest digit. 0
1, 2, 14, 34, 63, 78, 88, 116, 128, 134, 138, 141, 142, 143, 164, 182, 184, 186, 196, 211, 214, 236, 238, 248, 258, 261, 282, 285, 286, 314, 316, 318, 328, 334, 341, 343, 356, 363, 385, 403, 411, 413, 418, 422, 436, 438, 483, 488, 518, 556, 568, 582, 584, 603 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..54.

MATHEMATICA

Select[Range[1000], Max[IntegerDigits[#]]== DivisorSigma[0, #]&]  (* Harvey P. Dale, Mar 13 2011 *)

CROSSREFS

Sequence in context: A073535 A225292 A060626 * A034842 A324043 A230894

Adjacent sequences:  A096308 A096309 A096310 * A096312 A096313 A096314

KEYWORD

base,easy,nonn

AUTHOR

Jason Earls, Jun 27 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 16:54 EST 2020. Contains 331114 sequences. (Running on oeis4.)