The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A323062 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A323062

Numbers m > 0 such that floor(sqrt(2^(2m-1))) > 1/2 + sqrt(1/4 + 2^(2m-1) - 2^m).
(history; published version)

#14 by Alois P. Heinz at Fri Jan 11 16:02:40 EST 2019

STATUS

proposed

approved

#13 by Chai Wah Wu at Fri Jan 11 15:57:42 EST 2019

STATUS

editing

proposed

#12 by Chai Wah Wu at Fri Jan 11 15:57:39 EST 2019

LINKS

Chai Wah Wu, <a href="/A323062/b323062.txt">Table of n, a(n) for n = 1..10000</a>

STATUS

approved

editing

#11 by N. J. A. Sloane at Fri Jan 11 15:06:34 EST 2019

STATUS

proposed

approved

#10 by Chai Wah Wu at Fri Jan 11 11:29:32 EST 2019

STATUS

editing

proposed

#9 by Chai Wah Wu at Fri Jan 11 11:29:17 EST 2019

PROG

(Python)

from sympy import integer_nthroot

A323062_list = [k for k in range(1, 10000) if (2*integer_nthroot(2**(2*k-1), 2)[0]-1)**2 > 1 + 4*(2**(2*k-1) - 2**k)] # Chai Wah Wu, Jan 11 2019

STATUS

proposed

editing

#8 by Chai Wah Wu at Fri Jan 11 10:55:31 EST 2019

STATUS

editing

proposed

Discussion

Fri Jan 11

11:29

Peter Luschny: Thanks!

#7 by Chai Wah Wu at Fri Jan 11 10:55:07 EST 2019

NAME

Numbers n m > 0 such that floor(sqrt(2^(2n2m-1))) > 1/2 + sqrt(1/4 + 2^(2n2m-1) - 2^nm).

Discussion

Fri Jan 11

10:55

Chai Wah Wu: replaced 'n' with 'm'

#6 by Chai Wah Wu at Fri Jan 11 10:54:22 EST 2019

COMMENTS

n m is a term if and only if floor(sqrt(2^(2n2m-1))) is a term of A323192. Equivalently, a(n) is the number of bits of the binary representation of A323192(n).

STATUS

proposed

editing

#5 by Chai Wah Wu at Fri Jan 11 10:04:08 EST 2019

STATUS

editing

proposed

Discussion

Fri Jan 11

10:26

Peter Luschny: The symbol 'n' is reserved to denote the index of a. Please use another name, for example 'm' or 'k' instead.

10:42

Peter Luschny: In the comment you use 'n' in two different meanings. This is confusing.