Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066410
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066410 Maximal sum of divisors of any n-digit number. +0
2
15, 252, 3048, 34560, 403200, 4390848, 45732192, 487710720, 5079674880, 52124083200, 542890252800, 5618427494400, 58517854617600, 591272607744000, 6026281863275520, 60762014342184960, 623846047297536000, 6394202229664972800, 64417520701204070400, 652677739551129600000 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(1) = 15 since sigma(8) is 15 and that is the record for 1-digit numbers.

PROGRAM

(PARI): maxsigdig(m, n)= { local(d, a, k, b); for(d=m, n, a=0; for(k=10^d, 10^(d+1)-1, b=sigma(k); if(b>a, a=b)); print1(a, ", "))} maxsigdig(0, 7)

CROSSREFS

Cf. A000203, A066424.

Sequence in context: A163031 A065920 A093147 this_sequence A116508 A055659 A123816

Adjacent sequences: A066407 A066408 A066409 this_sequence A066411 A066412 A066413

KEYWORD

base,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Dec 25 2001

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 26 2001

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research