Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056075
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A056075
%S A056075 1,4,56,7192,7232,7912,10792,17272,30592,114256,2154584,3428368,
%T A056075 44375136,89245784
%N A056075 Numbers n such that n | Sigma(n) - d(n).
%C A056075 Or, numbers n such that signa[n]=k.n+d[n] for some k.
%C A056075 For most terms>4, sigma[n]=2n+d[n], i.e. k=2. However, for the 12th term, 
               k=3.
%F A056075 Numbers n such that Mod[A000203(n), n]=A000005(n) or A054024(n)=A000005(n). 
               - Labos E. (labos(AT)ana.sote.hu), Apr 12 2002
%t A056075 Do[If[Mod[DivisorSigma[1, n]-DivisorSigma[0, n], n]==0, Print[n]], {n, 
               1, 10^8}]
%Y A056075 Cf. A000203, A000005, A054024.
%Y A056075 Sequence in context: A089516 A000573 A070019 this_sequence A000315 A080984 
               A071579
%Y A056075 Adjacent sequences: A056072 A056073 A056074 this_sequence A056076 A056077 
               A056078
%K A056075 nonn
%O A056075 1,2
%A A056075 Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 26 2000

    
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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research