|
|
A073477
|
|
Least k such that 2^n = k^2-sigma(k)*phi(k).
|
|
0
|
|
|
2, 4, 8, 16, 32, 12, 20, 256, 44, 1024, 2048, 4096, 8192, 16384, 992, 65536, 724, 262144, 2080, 1048576, 16256, 4194304, 8388608, 16777216, 33554432, 67108864, 48832, 268435456, 536870912, 1073741824, 471808, 4294967296, 8589934592, 17179869184, 34359738368
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Sequence is always defined since for s=2^(n+1), 2^n = s^2-sigma(s)*phi(s). - R. J. Mathar, Oct 01 2011
a(38) = 67100672. a(50) = 17179738112. a(56) <= 274877382656. - Donovan Johnson, Oct 02 2011
|
|
LINKS
|
|
|
FORMULA
|
a(n) = min{k: A069249(k)=2^n}. - R. J. Mathar, Oct 01 2011
|
|
PROG
|
(PARI) a(n)=if(n<0, 0, x=1; while(abs(x^2-sigma(x)*eulerphi(x)-2^n)>0, x++)); x
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|