Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046762
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046762 Sum of the squares of the divisors of n is divisible by n. +0
4
1, 10, 60, 65, 84, 130, 140, 150, 175, 260, 350, 420, 525, 780, 1050, 1105, 1820, 2100, 2210, 4420, 4650, 5425, 5460, 8840, 10500, 10850, 13260, 16275, 19720, 20150, 20737, 21700, 30225, 30940, 32045, 32550, 41474, 45500, 55250, 57350, 60450 (list; graph; listen)
OFFSET

1,2

COMMENT

Compare with multiply perfect numbers A007691. Here Sum[ divisors ] is replaced by Sum[ square of divisors ].

Problem 11090 proves that this sequence is infinite. - T. D. Noe (noe(AT)sspectra.com), Apr 18 2006

REFERENCES

Florian Luca, Problem 11090: Sometimes n divides sigma_k(n), Amer. Math. Monthly 113 (2006), 372-373.

EXAMPLE

n=65=a[ 4 ], sigma[ 2,65 ]=4420=65*68=68*n or n=1820=a[ 17 ], the divisor-square sum is 4641000=2550*1820=2880*n

CROSSREFS

A007691.

Sequence in context: A054489 A140890 A055714 this_sequence A066290 A065641 A121874

Adjacent sequences: A046759 A046760 A046761 this_sequence A046763 A046764 A046765

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu)

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research