A364965 revision #3
|
| |
|
|
A364965
|
|
Odd numbers k such that k is a multiple of A243071(k).
|
|
2
|
| |
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
|
|
|
PROG
|
(PARI)
A243071(n) = if(n<=2, n-1, my(f=factor(n), p, p2=1, res=0); for(i=1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p*p2*(2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); ((3<<#binary(res\2))-res-1)); \\ (Combining programs given in A156552 and A054429)
isA364965(n) = ((n>1)&&(n%2)&&!(n%A243071(n)));
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,changed
|
|
|
AUTHOR
|
|
|
|
STATUS
|
editing
|
| |
|
|
