Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045884
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045884 Largest number m such that in base n, the sum of digits in the divisors of m is n (written in base n). +0
2
110, 20, 10, 14, 24, 42, 34, 11, 15 (list; graph; listen)
OFFSET

2,1

EXAMPLE

e.g. [ Decimal ] divisors of 15 are (1,3,5,15), 1+3+5+1+5=15.

CROSSREFS

Cf. A045885.

Sequence in context: A125044 A096209 A087303 this_sequence A110736 A084292 A039724

Adjacent sequences: A045881 A045882 A045883 this_sequence A045885 A045886 A045887

KEYWORD

easy,fini,nonn,base

AUTHOR

Author's name lost.

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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research