cp's OEIS Frontend

A246082 Paradigm shift sequence for (0,4) production scheme with replacement.

%I A246082 #10 Nov 19 2016 03:06:41
%S A246082 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,18,20,22,24,27,30,33,36,39,42,
%T A246082 45,48,54,60,66,72,81,90,99,108,117,126,135,144,162,180,198,216,243,
%U A246082 270,297,324,351,378,405,432,486,540,594,648,729,810,891,972,1053,1134,1215,1296,1458,1620,1782
%N A246082 Paradigm shift sequence for (0,4) production scheme with replacement.
%C A246082 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=4 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 A246082 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 A246082 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 A246082 3. The ideal number of implementations per bundle, as measured by the geometric growth rate (p+zq root of z), is z = 3.
%C A246082 4. All solutions will be of the form a(n) = (qm+r) * m^b * (m+1)^d.
%C A246082 5. For large n, the sequence is recursively defined.
%H A246082 Colin Barker, <a href="/A246082/b246082.txt">Table of n, a(n) for n = 1..1000</a>
%H A246082 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,0,0,0,0,3).
%F A246082 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 A246082 a(n) = 3*a(n-12) for all n >= 20.
%F A246082 G.f.: x*(1+x)^2 * (1+x^2)^2 * (1+2*x^4+3*x^8+x^12) / (1-3*x^12). - _Colin Barker_, Nov 19 2016
%o A246082 (PARI) Vec(x*(1+x)^2 * (1+x^2)^2 * (1+2*x^4+3*x^8+x^12) / (1-3*x^12) + O(x^100)) \\ _Colin Barker_, Nov 19 2016
%Y A246082 Paradigm shift sequences with q=4: A029750, A103969, A246074, A246078, A246082, A246086, A246090, A246094, A246098, A246102.
%Y A246082 Paradigm shift sequences with p=0: A000792, A246080, A246081, A246082, A246083.
%K A246082 nonn,easy
%O A246082 1,2
%A A246082 _Jonathan T. Rowell_, Aug 13 2014