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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A246097 Paradigm shift sequence for (4,3) production scheme with replacement. 9

%I #6 Aug 15 2014 23:08:08

%S 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,21,24,27,30,33,36,40,

%T 44,48,52,56,60,65,70,75,81,90,99,108,120,132,144,160,176,192,208,224,

%U 240,260,280,300,325,360,396,432,480,528,576,640,704,768,832,896,960,1040,1120,1200,1300,1440,1584,1728,1920,2112,2304,2560,2816,3072,3328,3584,3840,4160,4480,4800,5200,5760,6336,6912,7680,8448,9216,10240,11264,12288,13312,14336,15360,16640,17920,19200,20800,23040

%N Paradigm shift sequence for (4,3) production scheme with replacement.

%C 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=4 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 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 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 3. The ideal number of implementations per bundle, as measured by the geometric growth rate (p+zq root of z), is z = 4.

%C 4. All solutions will be of the form a(n) = (qm+r) * m^b * (m+1)^d.

%F 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 Recursive: a(n) = 4*a(n-16) for all n >= 52.

%Y Paradigm shift sequences with q=3: A029747, A029750, A246077, A246081, A246085, A246089, A246093, A246097, A246101.

%Y Paradigm shift sequences with p=4: A193456, A246096, A246097, A246098, A246099.

%K nonn

%O 1,2

%A _Jonathan T. Rowell_, Aug 13 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 15:04 EDT 2024. Contains 371914 sequences. (Running on oeis4.)