[seqfan] Re: n < 2^tau(n)
q1qq2qqq3qqqq at yahoo.com
Sun May 30 19:43:46 CEST 2010
For everyone's information: Vladimir Shevelev showed in a private email using some higher math asymptotics that my sequence is infinite.
And Douglas McNeil help show in a private email, through some much simpler math, that all powers of 2 are in my sequence (duh! -- slap self in head), hence the sequence is infinite.
So, no need for anyone to look further for a proof of finitude or infinitude.
[ ( [ ([( [ ( ([[o0Oo0Ooo0Oo(0)oO0ooO0oO0o]]) ) ] )]) ] ) ]
--- On Sun, 5/30/10, Leroy Quet <q1qq2qqq3qqqq at yahoo.com> wrote:
> From: Leroy Quet <q1qq2qqq3qqqq at yahoo.com>
> Subject: [seqfan] n < 2^tau(n)
> To: seqfan at seqfan.eu
> Date: Sunday, May 30, 2010, 12:38 PM
> I just submitted this sequence.
> %S A175495
> %N A175495 Those positive integers n where n < 2^d(n),
> where d(n) = number of divisors of n.
> %C A175495 After the initial 1 in this sequence, the first
> integer in this sequence but not in A034884 is 44.
> %C A175495 This sequence is those n where A175494(n) = 1.
> %Y A175495 CF. A175494, A034884
> %K A175495 more,nonn
> %O A175495 1,2
> (By the way, A175494(n) = floor(n^(1/d(n))).)
> Is this sequence (A175495) finite?
> Leroy Quet
> [ ( [ ([( [ ( ([[o0Oo0Ooo0Oo(0)oO0ooO0oO0o]]) ) ] )]) ] )
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan