This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A246091 #6 Aug 15 2014 23:07:23 %S A246091 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,26,28, %T A246091 30,33,36,39,42,45,48,51,54,57,60,64,68,72,76,80,84,90,99,108,117,126, %U A246091 135,144,153,162,171,180,192,204,216,228,240,256,272,297,324,351,378,405,432,459,486,513,540,576,612,648,684,720,768,816,891,972,1053,1134,1215,1296,1377,1458,1539,1620 %N A246091 Paradigm shift sequence for (2,5) production scheme with replacement. %C A246091 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=2 steps), or implement the current bundled action (which requires q=5 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 A246091 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 A246091 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 A246091 3. The ideal number of implementations per bundle, as measured by the geometric growth rate (p+zq root of z), is z = 3. %C A246091 4. All solutions will be of the form a(n) = (qm+r) * m^b * (m+1)^d. %F A246091 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 A246091 Recursive: a(n) = 3*a(n-17) for all n >= 62. %Y A246091 Paradigm shift sequences with q=5: A103969, A246074, A246075, A246076, A246079, A246083, A246087, A246091, A246095, A246099, A246103. %Y A246091 Paradigm shift sequences with p=2: A193286, A246088, A246089, A246090, A246091. %K A246091 nonn %O A246091 1,2 %A A246091 _Jonathan T. Rowell_, Aug 13 2014