

A298306


The Frobenius number of the set of binary nth powers, divided out by its GCD.


0




OFFSET

2,1


COMMENTS

The binary nth powers are those positive integers whose base2 representation consists of n consecutive identical blocks. For example, the binary squares 3, 10, 15, ... form sequence A020330. The GCD of the binary nth powers form sequence A014491. The Frobenius number of a set S with GCD 1 is the largest number not representable as an Nlinear combination of members of S.


LINKS

Table of n, a(n) for n=2..6.
Daniel M. Kane, Carlo Sanna, and Jeffrey Shallit, Waring's theorem for binary powers, arXiv:1801.04483 [math.NT], Jan 13 2018.


EXAMPLE

For n = 2 the first few binary squares are 3, 10, 15, 36, ... with GCD 1 and the Frobenius number of (3, 10, 15, 36) is 17.


CROSSREFS

Cf. A020330, A014491.
Sequence in context: A012193 A128274 A012085 * A308696 A308594 A308570
Adjacent sequences: A298303 A298304 A298305 * A298307 A298308 A298309


KEYWORD

nonn,more


AUTHOR

Jeffrey Shallit, Jan 16 2018


STATUS

approved



