Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068997
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A068997
%S A068997 1,2,4,6,8,12,16,18,20,24,32,36,40,48,54,64,72,80,84,96,100,108,120,
%T A068997 128,144,160,162,168,192,200,216,240,252,256,272,288,312,320,324,336,
%U A068997 360,384,400,432,440,480,486,500,504,512,544,576,588,600,624,640,648
%N A068997 Numbers n such that sum( d divides n,d*mu(d)) divides n.
%H A068997 T. D. Noe, <a href="b068997.txt">Table of n, a(n) for n=1..1000</a>
%F A068997 n such that A023900(n) divides n
%o A068997 (PARI) for(n=1,1000,if(n%sumdiv(n,d,moebius(d)*d)==0,print1(n,",")))
%Y A068997 Sequence in context: A005153 A068563 A124240 this_sequence A067712 A060765 
               A140110
%Y A068997 Adjacent sequences: A068994 A068995 A068996 this_sequence A068998 A068999 
               A069000
%K A068997 easy,nonn
%O A068997 1,2
%A A068997 Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 07 2002

    
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