login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A358022
Least odd number m such that m*2^n is an amicable number, and -1 if no such number exists.
1
12285, 605, 55, 779, 1081, 37, 119957, 73153, 2927269, 239, 25329329, 7230607, 964119281, 66445153, 7613527, 18431675687, 328796066369, 264003743, 11298797322497, 59592560831, 949755039781, 2759891672513
OFFSET
0,1
COMMENTS
Similar to A358320 but restricted to amicable numbers.
PROG
(PARI) f(m) = if (m, sigma(m)-m, 0);
fpm(p, m) = (2*p-1)*sigma(m) - p*m;
a(n) = my(p=2^n); forstep(m=1, +oo, 2, my(x=fpm(p, m)); if ((x!=p*m) && (f(x) == p*m), return(m)));
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Michel Marcus, Nov 17 2022
EXTENSIONS
a(12)-a(22) were calculated using Chernykh's database by Amiram Eldar, Nov 17 2022
STATUS
approved