The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A246100 Paradigm shift sequence for (5,2) production scheme with replacement. 9
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 21, 24, 28, 32, 36, 40, 45, 50, 55, 60, 66, 72, 78, 84, 96, 112, 128, 144, 160, 180, 200, 225, 250, 275, 300, 330, 360, 396, 448, 512, 576, 640, 720, 800, 900, 1000, 1125, 1250, 1375, 1500, 1650, 1800, 2048, 2304, 2560, 2880, 3200, 3600, 4000, 4500, 5000, 5625, 6250, 6875, 7500, 8250, 9216, 10240, 11520, 12800, 14400, 16000, 18000, 20000, 22500, 25000, 28125, 31250, 34375, 37500, 41250, 46080, 51200, 57600, 64000, 72000, 80000, 90000, 100000, 112500, 125000, 140625, 156250 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 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=5 steps), or implement the current bundled action (which requires q=2 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?" 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. 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. 3. The ideal number of implementations per bundle, as measured by the geometric growth rate (p+zq root of z), is z = 5. 4. All solutions will be of the form a(n) = (qm+r) * m^b * (m+1)^d. LINKS FORMULA 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) ). Recursive:  a(n) = 5*a(n-15) for all n >= 75. CROSSREFS Paradigm shift sequences with q=2: A029744, A029747, A246080, A246084, A246088, A246092, A246096, A246100. Paradigm shift sequences with p=5: A193457, A246100, A246101, A246102, A246103. Sequence in context: A241989 A246089 A078510 * A247250 A017909 A316530 Adjacent sequences:  A246097 A246098 A246099 * A246101 A246102 A246103 KEYWORD nonn AUTHOR Jonathan T. Rowell, Aug 13 2014 STATUS approved

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

Last modified April 21 14:29 EDT 2021. Contains 343154 sequences. (Running on oeis4.)