A260817 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

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