Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066150
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066150 Maximal number of divisors of any n-digit number. +0
3
4, 12, 32, 64, 128, 240, 448, 768, 1344, 2304, 4032, 6720, 10752, 17280, 26880, 41472, 64512, 103680, 161280, 245760, 368640, 552960, 860160, 1290240, 1966080, 2764800, 4128768, 6193152, 8957952, 13271040, 19660800, 28311552, 41287680, 59719680, 88473600, 127401984, 181665792, 264241152, 382205952, 530841600 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(1) = 4 since 8 has 4 divisors and that is the record for 1-digit numbers.

PROGRAM

(PARI): a066150(m, n) = local(d, a, k, b); for(d=m, n, a=0; for(k=10^d, 10^(d+1)-1, b =numdiv(k); if(b>a, a=b)); print1(a, ", ")) a066150(0, 6)

CROSSREFS

Cf. A066151, A069650.

Sequence in context: A005104 A028921 A028922 this_sequence A133212 A127811 A138517

Adjacent sequences: A066147 A066148 A066149 this_sequence A066151 A066152 A066153

KEYWORD

nonn,base,easy

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Dec 12 2001

EXTENSIONS

One more term from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Dec 13 2001

Further terms from Vladeta Jovovic and Vladimir Baltic (vladeta(AT)Eunet.yu), Dec 16 2001

Extended further by David Wasserman (dwasserm(AT)earthlink.net), Jan 25 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 8 15:51 EDT 2008. Contains 142751 sequences.


AT&T Labs Research