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 A287056 #26 Dec 09 2017 19:29:58 %S A287056 -1,-1,-1,-1,-1,1,1,-1,1,1,1,1,1,0,-1,1,1,1,1,1,1,-1,2,2,1,-1,1,1,1,1, %T A287056 1,1,1,1,1,-1,2,2,2,-1,3,3,3,3,-1,4,4,-1,5,5,5,5,5,5,5,5,5,4,4,4,4,4, %U A287056 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2 %N A287056 a(n) is such that A100827(n) = A082917(n - a(n)) - 1, or -1 if there is no corresponding term. %C A287056 Most of the known terms of A100827 are 1 less than a term in A082917, and conversely. This sequences looks at the location in the sequence of the corresponding terms. Negative terms do not occur among the known terms of this sequence. When a(n+1) is different from a(n) (and both are nonnegative), there are |a(n+1)-a(n)| terms in one of the sequences that aren't in the other. With some irregularities, this sequence generally gradually increases at first, reaching a(49)=5. Then there are 9 a(n)=5, followed by 20 a(n)=4, followed by 30 a(n)=3, and then a(n)=2 for n=108 to 229. What is the behavior of the rest of the sequence? Does it stay at a(n)=2? %H A287056 Jud McCranie, <a href="/A287056/b287056.txt">Table of n, a(n) for n = 1..229</a> %e A287056 Examples: A100827(6)=47, A082917(5)=47+1, so a(6) = 6-5 = 1. A100827(23)=779, A082917(21)=779+1, so a(23) = 23-21 = 2. %Y A287056 Cf. A082917, A100827. %K A287056 sign %O A287056 1,23 %A A287056 _Jud McCranie_, May 18 2017