OFFSET
1,1
COMMENTS
LINKS
PROG
(PARI)
A007947(n) = factorback(factorint(n)[, 1]);
A048675(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; }; \\ After Michel Marcus
A019565(n) = {my(j, v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ This function from M. F. Hasler
n=0; k=1; while(k <= 10000, n=n+1; if(isA286611(n), write("b286611.txt", k, " ", n); k=k+1));
(Scheme, with Antti Karttunen's IntSeq-library)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Jun 20 2017
STATUS
approved