|
|
A233416
|
|
c-perfect numbers.
|
|
3
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A number k is called a c-perfect number if the sum of its proper c-divisors equals k.
For the definition of a c-divisor of an integer, see comment in A124771.
Sequence in binary: 1011, 1000111, 11100010, 111001011100, 100001000001111, 100010111000111100011, 10010000000101000110011, 100001111110010100110011...
Next term > 10^7. (End)
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n=11 which is a concatenation of binary parts (10)(1)(1); we have proper positive c-divisors 1, 2, 3, and 5, the sum of which is 11, so 11 is in the sequence.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|