Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056076
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056076 Numbers n such that n divides sigma(n) + d(n), where d(n) is the number of divisors of n and sigma(n) is their sum. +0
1
1, 3, 14, 52, 60, 130, 184, 656, 5472, 8648, 12008, 34688, 2118656, 2500704, 33721216, 40575616, 59376256, 89397016, 99523456, 134438912, 150441856, 173706136, 283417216, 537346048 (list; graph; listen)
OFFSET

1,2

COMMENT

Do[If[Mod[DivisorSigma[1,n]+DivisorSigma[0,n],n]==0,Print[n]],{n,1,10^8}]

PROGRAM

(PARI) for(n=1, 10^8, if(Mod((sigma(n)+numdiv(n)), n)==0, print(n)))

CROSSREFS

Cf. A000203, A000005.

Sequence in context: A063025 A098521 A084150 this_sequence A117133 A083874 A105331

Adjacent sequences: A056073 A056074 A056075 this_sequence A056077 A056078 A056079

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 26 2000

EXTENSIONS

Corrected by Jason Earls (zevi_35711(AT)yahoo.com), Aug 06 2001

Corrected by T. D. Noe (noe(AT)sspectra.com), Nov 01 2006

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 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research