cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A357656 a(n) is a lower bound for the largest Hamming weight of squares with exactly n binary zeros.

Original entry on oeis.org

1, 0, 13, 8, 13, 16, 37, 38, 44
Offset: 0

Views

Author

Keywords

Comments

The terms from a(2) onwards must be regarded as lower bounds, because no proof for the non-existence of squares with a very small number of binary zeros in the range k^2 > 2^90 (see b-file of A230097) is known.
a(9) >= 63, a(10) >= 57.

Examples

			                A357657(n)
   n  a(n) bits     k       k^2          k^2 in binary
   0    1    1      1         1                      1
   1    0    1      0         0                      0
   2   13   15    181     32761        111111111111001
   3    8   11     45      2025            11111101001
   4   13   17    362    131044      11111111111100100
   5   16   21   1241   1540081  101110111111111110001
		

Crossrefs

A357657 are the corresponding square roots of the record-setting squares.

A357657 a(n) is a lower bound for the square root of the maximum square with exactly n zeros in its binary representation.

Original entry on oeis.org

1, 0, 181, 45, 362, 1241, 2965685, 5931189, 57804981
Offset: 0

Views

Author

Keywords

Comments

See A357656 for more information.
a(9) >= 66537313397, a(10) >= 10520476455.

Crossrefs

A357656 gives the Hamming weight of the squared terms.
Showing 1-2 of 2 results.