|
%I #80 Jan 31 2024 01:15:20
%S 1,1,2,5,13,36,102,295,864,2557,7624,22868,68920,208527,632987,
%T 1926752,5878738,17973523,55050690,168881464,518818523,1595878573,
%U 4914522147,15150038699,46747391412,144370209690,446214862158,1380161749537,4271808447154,13230257155092,40999697820032
%N Number of polynomials of the form P(x,y) = 1 + (x+y-1) * Q(x,y) such that P(1,1) = n and both polynomials P and Q have nonnegative integer coefficients.
%C Original definition did not have the requirement for Q to have nonnegative coefficients. However, this results in different terms given by A363933. We have a(n) <= A363933(n), which is strict for n >= 5. - _Max Alekseyev_, Jun 28 2023
%C In colorful terms, one can view a polynomial as a configuration made of piles of tokens located at lattice points (i>=0, j>=0). One introduces the notion of "degradation of a configuration": to degrade a configuration, choose a nonempty pile of tokens in it, say that at (i,j); remove one token from that pile; then add one token at (i+1,j) and one token at (i,j+1). This is a nondeterministic process. a(n) is the number of distinct configurations one can possibly get after (n-1) degradations of the initial configuration consisting of just one token at (0,0). In this metaphor, the P's are the resulting configurations and the Q's are records of where the tokens have been taken. - _Luc Rousseau_, Jun 30 2023
%H Luc Rousseau, <a href="/A279196/b279196.txt">Table of n, a(n) for n = 1..45</a>
%H R. K. Guy, Letter to N. J. A. Sloane, June 24 1971: <a href="/A002572/a002572.jpg">front</a>, <a href="/A002572/a002572_1.jpg">back</a> [Annotated scanned copy, with permission] See sequence "D".
%H Luc Rousseau, <a href="/A279196/a279196.java.txt">a Java program for A279196, by degradation</a>.
%H Luc Rousseau, <a href="/A279196/a279196_1.java.txt">a Java + Prolog program for A279196, nonnegativity CLP version</a>.
%H Luc Rousseau, <a href="/A279196/a279196.pl.txt">a Prolog program for A279196, divide and conquer, memoized version</a>.
%H Luc Rousseau, <a href="/A279196/a279196.pdf">Illustration of the degradation process, n=1..5</a>
%H N. J. A. Sloane, <a href="https://vimeo.com/201218446">Winter Fruits: New Problems from OEIS, Dec. 2016 - Jan. 2017 (part 1)</a>, 2017-01-26, (discussion from 6:23-10:00).
%H N. J. A. Sloane, <a href="/A002844/a002844.pdf">Winter Fruits: New Problems from the OEIS, Dec. 2016 - Jan. 2017 (slides)</a>
%e From _Peter Kagey_, Feb 03 2017 (Start):
%e For n = 1 the a(1) = 1 solution is:
%e 1 = 0(x + y - 1) + 1.
%e For n = 2 the a(2) = 1 solution is:
%e x + y = (x + y - 1) + 1.
%e For n = 3 the a(3) = 2 solutions are:
%e xy + x + y^2 = (y + 1)(x + y - 1) + 1;
%e xy + y + x^2 = (x + 1)(x + y - 1) + 1.
%e For n = 4 the a(4) = 5 solutions are:
%e x^2 + 2xy + y^2 = (x + y + 1)(x + y - 1) + 1;
%e x^2y + x^2 + xy^2 + y = (xy + x + 1)(x + y - 1) + 1;
%e x^2y + xy^2 + x + y^2 = (xy + y + 1)(x + y - 1) + 1;
%e xy^2 + xy + x + y^3 = (y^2 + y + 1)(x + y - 1) + 1;
%e x^3 + x^2y + xy + y = (x^2 + x + 1)(x + y - 1) + 1.
%e (End) [Corrected by _Luc Rousseau_, Jun 30 2023]
%o (Java) // See link. _Luc Rousseau_, Jun 30 2023
%o (Java + Prolog) // See link. _Luc Rousseau_, Jun 30 2023
%o (Prolog) % See link. _Luc Rousseau_, Jul 26 2023
%Y Cf. A363933.
%K nonn
%O 1,3
%A _N. J. A. Sloane_, Dec 15 2016
%E Definition corrected by _Max Alekseyev_, Jun 28 2023
%E a(10)-a(18) from _Luc Rousseau_, Jun 30 2023
%E a(19)-a(25) from _Max Alekseyev_, Jul 04 2023
%E a(26)-a(29) from _Luc Rousseau_, Jul 31 2023
%E a(30) from _Luc Rousseau_, Nov 10 2023
%E a(31) from _Luc Rousseau_, Dec 18 2023
| 