Quasiperfect numbers
C_K_Yang czp001 liuguangxi a_forsteri Burloq madbat2 Min_25 C3PO Philippe_57721 kumaus gerrob hallvabo mathpseudo sinan Phicar hervas lesnik7 djcomidi Caesum clytorock Buri jablonskim nielkh
Public  09/05/14  7xp  Programming  51.9% 
An integer is perfect if it is equal to the sum of its proper divisors.
Let say an integer is quasiperfect if it can be written as a sum of some distinct of its proper divisors
For instance, N = 150 as the following proper divisors:
1,2,3,5,6,10,15,25,30,50,75
and can be written as:
Find the first such decomposition for 1000768 (in lexicographic order):
Answer format: comma separated list of divisors in ascending order.
Example: 1,3,5,6,10,50,75
[My timing : 50 sec]
Let say an integer is quasiperfect if it can be written as a sum of some distinct of its proper divisors
For instance, N = 150 as the following proper divisors:
1,2,3,5,6,10,15,25,30,50,75
and can be written as:
 1 + 3 + 5 + 6 + 10 + 50 + 75
 1 + 3 + 6 + 10 + 25 + 30 + 75
 1 + 3 + 6 + 15 + 50 + 75
 2 + 3 + 5 + 10 + 25 + 30 + 75
 2 + 3 + 5 + 15 + 50 + 75
 2 + 3 + 15 + 25 + 30 + 75
 5 + 15 + 25 + 30 + 75
 10 + 15 + 50 + 75
 25 + 50 + 75
Find the first such decomposition for 1000768 (in lexicographic order):
Answer format: comma separated list of divisors in ascending order.
Example: 1,3,5,6,10,50,75
[My timing : 50 sec]
New Members
 nebula001 2d:6h
 PeterisP 1w
 Arun_CoDeR 1w
 hankim 2w:2d
 chfmoe 2w:6d
Fresh Problems

Kimberling Sequence 12h:1m
solved by 3 
Palindromic Infinite Sequence 1w
solved by 3 
Convergents of infinite sum 1w:4d
solved by 5 
Permutation Order II 2w
solved by 8 
Integral circle packings 2 2w:4d
solved by 3