|
Search: id:A006036
|
|
|
| A006036 |
|
Primitive pseudoperfect numbers.
(Formerly M4133)
|
|
+0
3
|
|
| 6, 20, 28, 88, 104, 272, 304, 350, 368, 464, 490, 496, 550, 572, 650, 748, 770, 910, 945, 1184, 1190, 1312, 1330, 1376, 1430, 1504, 1575, 1610, 1696, 1870, 1888, 1952, 2002, 2030, 2090, 2170, 2205, 2210, 2470, 2530, 2584, 2590, 2870, 2990, 3010, 3128, 3190, 3230, 3290, 3410, 3465, 3496, 3710, 3770, 3944, 4070, 4095, 4130, 4216, 4270, 4288, 4408, 4510, 4544, 4672, 4690, 4712, 4730, 4970
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
A primitive pseudoperfect number is a pseudoperfect number that is not a multiple of any other pseudoperfect number.
The odd entries so far are identical to the odd primitive abundant A006038. - Walter A. Kehowski (wkehowski(AT)cox.net), Aug 12 2005
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, B2.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
MAPLE
|
with(numtheory): with(combinat): issemiperfect := proc(n) local b, S;
b:=false; S:=subsets(divisors(n) minus {n}); while not S[finished] do if
convert(S[nextvalue](), `+`)=n then b:=true; break fi od; return b end:
L:=remove(proc(z) isprime(z) end, [$1..5000]): PP:=[]: for zz from 1 to 1 do
for n in L do if issemiperfect(n) then PP:=[op(PP), n] fi od od;
sr := proc(l::list) local x, R, S, P, L; S:=sort(l); R:=[]; P:=S;
for x in S do
if not(x in R) then
L:=selectremove(proc(z) z>x and z mod x = 0 end, P);
R:=[op(R), op(L[1])]; P:=L[2];
fi; od; return P; end:
PPP:=sr(PP); # primitive pseudoperfect numbers less than 5000 (Walter A. Kehowski)
|
|
CROSSREFS
|
Cf. A005835.
Sequence in context: A119425 A006039 A064771 this_sequence A140738 A031005 A106528
Adjacent sequences: A006033 A006034 A006035 this_sequence A006037 A006038 A006039
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas, R. K. Guy
|
|
EXTENSIONS
|
More terms from Walter A. Kehowski (wkehowski(AT)cox.net), Aug 12 2005
|
|
|
Search completed in 0.002 seconds
|
