A260817 Maximal degree of a polynomial P = Sum_{k=0..m} x^{d(k)} with 0 = d(0) < ... < d(m) such that P^2 = Sum_{k>=0} B(k) x^k has B(k) <= n for all k and B(k) > 0 for k <= d(m).

1, 3, 8, 40, 52, 264, 328

Offset

1,2

Comments

See the main entry A260551 for further comments and references, and A260818 for the maximal "length" of the polynomials.

Links

Table of n, a(n) for n=1..7.

Peter Borwein, Stephen Choi and Frank Chu, An old conjecture of Erdös-Turán on additive bases, Math. Comp. 75 (2006), 475-484, see Table 1 p. 481.

Crossrefs

Sequence in context: A034892 A072687 A353718 * A262126 A110561 A107991

Adjacent sequences: A260814 A260815 A260816 * A260818 A260819 A260820

Keyword

nonn,hard,more

Author

M. F. Hasler, Jul 31 2015

Status

approved