[seqfan] Re: A122036
charles.greathouse at case.edu
Mon Mar 28 19:58:00 CEST 2011
It would be nice to have an efficient program and a b-file for A006038.
Thinking about Dickson's well-known finitude result cited there, I
wonder if there's an effective bound? That would allow the two
sequences "Largest odd primitive abundant k with exactly n (distinct)
prime factors" which I think would be nice. The first terms of the
respective sequences seem to be a(3) = 570375 and a'(5) = 442365.
a'(6) >= 13455037365.
Case Western Reserve University
On Mon, Mar 28, 2011 at 12:48 PM, <franktaw at netscape.net> wrote:
> It should be possible to obtain further speedup by noting that only odd
> primitive abundant numbers (A006038) need be checked (given that there are
> no odd weird numbers (A006037) in range). A carefully written program
> should be able to generate these up to a specified limit pretty efficiently.
> Unfortunately neither A006038 nor A091191 has a program in the database.
> Franklin T. Adams-Watters
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan