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.
%I A298306 #11 Jan 17 2018 04:30:31 %S A298306 17,723,52753,49790415,126629 %N A298306 The Frobenius number of the set of binary n-th powers, divided out by its GCD. %C A298306 The binary n-th powers are those positive integers whose base-2 representation consists of n consecutive identical blocks. For example, the binary squares 3, 10, 15, ... form sequence A020330. The GCD of the binary n-th powers form sequence A014491. The Frobenius number of a set S with GCD 1 is the largest number not representable as an N-linear combination of members of S. %H A298306 Daniel M. Kane, Carlo Sanna, and Jeffrey Shallit, <a href="https://arxiv.org/abs/1801.04483">Waring's theorem for binary powers</a>, arXiv:1801.04483 [math.NT], Jan 13 2018. %e A298306 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. %Y A298306 Cf. A020330, A014491. %K A298306 nonn,more %O A298306 2,1 %A A298306 _Jeffrey Shallit_, Jan 16 2018