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 A134744 #17 Sep 28 2018 18:46:07 %S A134744 2,1,1,1,1,7,1,1,1,1,1,13,1,5,1,1,1,1,1,1,1,1,1,1,1,1,1,29,3,1,1,1,1, %T A134744 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,59,3,1,1,7,1,5,3,1,1, %U A134744 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1 %N A134744 First differences of A084663. %D A134744 Eric S. Rowland, A simple prime-generating recurrence, Abstracts Amer. Math. Soc., 29 (No. 1, 2008), p. 50 (Abstract 1035-11-986). %H A134744 Reinhard Zumkeller, <a href="/A134744/b134744.txt">Table of n, a(n) for n = 1..10000</a> %H A134744 Eric S. Rowland, <a href="http://arXiv.org/abs/0710.3217">A simple prime-generating recurrence</a>, arXiv:0710.3217 [math.NT], 2007-2008. %t A134744 b[1] = 8; b[n_] := b[n] = b[n-1] + GCD[n, b[n-1]]; %t A134744 Table[b[n], {n, 105}] // Differences (* _Jean-François Alcover_, Sep 28 2018 *) %o A134744 (Haskell) %o A134744 a134744 n = a134744_list !! (n-1) %o A134744 a134744_list = zipWith (-) (tail a084663_list) a084663_list %o A134744 -- _Reinhard Zumkeller_, Nov 15 2013 %Y A134744 Cf. A084663. See A106108 for other cross-references. %Y A134744 Cf. A132199, A134734, A134743. %K A134744 nonn %O A134744 1,1 %A A134744 _N. J. A. Sloane_, Jan 28 2008