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 A328196 #30 Jan 22 2022 23:36:18 %S A328196 2,4,-2,6,-3,9,-7,12,-9,14,-12,16,-13,19,-17,21,-18,24,-22,26,-23,29, %T A328196 -27,32,-29,34,-32,36,-33,39,-37,42,-39,44,-42,46,-43,49,-47,52,-49, %U A328196 54,-52,56,-53,59,-57,61,-58,64,-62,66,-63,69,-67,72,-69,74,-72,76 %N A328196 First differences of A328190. %C A328196 Conjecture from _N. J. A. Sloane_, Nov 05 2019: (Start) %C A328196 a(4t) = 5t+1(+1 if binary expansion of t ends in odd number of 0's) for t >= 1, %C A328196 a(4t+1) = -(5t-2(+1 if binary expansion of t ends in odd number of 0's)) for t >= 1, %C A328196 a(4t+2) = 5t+4 for t >= 0, %C A328196 a(4t+3) = -(5t+2) for t >= 0. %C A328196 These formulas explain all the known terms. %C A328196 a(2t) is closely related to A298468. The expressions for a(4t) and a(4t+1) can also be written in terms of A328979. %C A328196 The conjecture would establish that the terms lie on two straight lines, of slopes +-5/4. %C A328196 There is a similar conjecture for A328190. (End) %H A328196 Peter Kagey, <a href="/A328196/b328196.txt">Table of n, a(n) for n = 1..10000</a> %Y A328196 Cf. A298468, A328190, A328979. %Y A328196 The negative terms are (conjecturally) listed in A329982 (see also A328983). %Y A328196 See A328984 and A328985 for simpler sequences which almost have the properties of A329190 and A328196. - _N. J. A. Sloane_, Nov 07 2019 %K A328196 sign %O A328196 1,1 %A A328196 _Peter Kagey_, Oct 07 2019