login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290985 Number of amicable pairs with lesser member at most 2^n. 1
0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 3, 5, 7, 8, 9, 16, 22, 30, 42, 57, 68, 95, 133, 167, 205, 257, 342, 460, 605, 786, 1043, 1356, 1749, 2294, 2905, 3757, 4811, 6181, 7893, 10146, 13051, 16762, 21396, 27380, 34939, 44449, 56481, 71453, 90783, 115200, 145702, 184045, 232899, 294326, 372216 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,11

COMMENTS

Sergei Chernykh led a BOINC project to find a(64) = 2390655. The project took 7 months and used several hundred CPU-years of computation time.

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..64 (calculated from Chernykh's database)

S. Chernykh, Amicable Numbers

PROG

(PARI) has(n, f=factor(n))=my(t=sigma(f)-n); t>n && sigma(t)==n+t

a(n)=my(s); forfactored(k=1, 2^n, if(has(k[1], k[2]), s++)); s

CROSSREFS

Cf. A002025, A066873, A259180.

Sequence in context: A125716 A171614 A029601 * A182758 A274768 A272667

Adjacent sequences:  A290982 A290983 A290984 * A290986 A290987 A290988

KEYWORD

nonn,hard

AUTHOR

Charles R Greathouse IV, Aug 16 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 15:21 EDT 2019. Contains 328162 sequences. (Running on oeis4.)