Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056012
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A056012
%S A056012 1,2,4,6,90,408,586,2200352,11524640
%N A056012 Numbers n such that n | Sigma(n) + d(n) + Phi(n).
%t A056012 Do[If[Mod[DivisorSigma[1, n]+DivisorSigma[0, n]+EulerPhi[n], n]==0, Print[n]], 
               {n, 1, 10^7}]
%Y A056012 Sequence in context: A066220 A009257 A098757 this_sequence A066719 A033319 
               A090315
%Y A056012 Adjacent sequences: A056009 A056010 A056011 this_sequence A056013 A056014 
               A056015
%K A056012 nonn
%O A056012 1,2
%A A056012 Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 24 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research