cp's OEIS Frontend

A246081 Paradigm shift sequence for (0,3) production scheme with replacement.

%I A246081 #11 Nov 19 2016 05:32:56
%S A246081 1,2,3,4,5,6,7,8,9,10,11,12,14,16,18,21,24,27,30,33,36,42,48,54,63,72,
%T A246081 81,90,99,108,126,144,162,189,216,243,270,297,324,378,432,486,567,648,
%U A246081 729,810,891,972,1134,1296,1458,1701,1944,2187,2430,2673,2916,3402,3888,4374,5103,5832,6561,7290,8019,8748
%N A246081 Paradigm shift sequence for (0,3) production scheme with replacement.
%C A246081 This sequence is the solution to the following problem: "Suppose you have the choice of using one of three production options: apply a simple incremental action, bundle existing output as an integrated product (which requires p=0 steps), or implement the current bundled action (which requires q=3 steps). The first use of a novel bundle erases (or makes obsolete) all prior actions. How large an output can be generated in n time steps?"
%C A246081 1. A production scheme with replacement R(p,q) eliminates existing output following a bundling action, while an additive scheme A(p,q) retains the output. The schemes correspond according to A(p,q)=R(p-q,q), with the replacement scheme serving as the default presentation.
%C A246081 2. This problem is structurally similar to the Copy and Paste Keyboard problem: Existing sequences (A178715 and A193286) should be regarded as Paradigm-Shift Sequences with production schemes R(1,1) and R(2,1) with replacement, respectively.
%C A246081 3. The ideal number of implementations per bundle, as measured by the geometric growth rate (p+zq root of z), is z = 3.
%C A246081 4. All solutions will be of the form a(n) = (qm+r) * m^b * (m+1)^d.
%C A246081 5. For large n, the sequence is recursively defined.
%H A246081 Colin Barker, <a href="/A246081/b246081.txt">Table of n, a(n) for n = 1..1000</a>
%H A246081 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,3).
%F A246081 a(n) = (qd+r) * d^(C-R) * (d+1)^R, where r = (n-Cp) mod q, Q = floor( (R-Cp)/q ), R = Q mod (C+1), and d = floor (Q/(C+1) ).
%F A246081 a(n) = 3*a(n-9) for all n >= 15.
%F A246081 G.f.: x*(1+x+x^2)^2 * (1-x+x^3) * (1+x+x^2+2*x^3+x^4+x^6) / (1-3*x^9). - _Colin Barker_, Nov 19 2016
%o A246081 (PARI) Vec(x*(1+x+x^2)^2 * (1-x+x^3) * (1+x+x^2+2*x^3+x^4+x^6) / (1-3*x^9) + O(x^100)) \\ _Colin Barker_, Nov 19 2016
%Y A246081 Paradigm shift sequences with q=3: A029747, A029750, A246077, A246081, A246085, A246089, A246093, A246097, A246101.
%Y A246081 Paradigm shift sequences with p=0: A000792, A246080, A246081, A246082, A246083.
%K A246081 nonn,easy
%O A246081 1,2
%A A246081 _Jonathan T. Rowell_, Aug 13 2014