|
Search: id:A068997
|
|
|
| A068997 |
|
Numbers n such that sum( d divides n,d*mu(d)) divides n. |
|
+0
1
|
|
| 1, 2, 4, 6, 8, 12, 16, 18, 20, 24, 32, 36, 40, 48, 54, 64, 72, 80, 84, 96, 100, 108, 120, 128, 144, 160, 162, 168, 192, 200, 216, 240, 252, 256, 272, 288, 312, 320, 324, 336, 360, 384, 400, 432, 440, 480, 486, 500, 504, 512, 544, 576, 588, 600, 624, 640, 648
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
FORMULA
|
n such that A023900(n) divides n
|
|
PROGRAM
|
(PARI) for(n=1, 1000, if(n%sumdiv(n, d, moebius(d)*d)==0, print1(n, ", ")))
|
|
CROSSREFS
|
Sequence in context: A005153 A068563 A124240 this_sequence A067712 A060765 A140110
Adjacent sequences: A068994 A068995 A068996 this_sequence A068998 A068999 A069000
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 07 2002
|
|
|
Search completed in 0.002 seconds
|
