cp's OEIS Frontend

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.

A134734 First differences of A084662.

This page as a plain text file.
%I A134734 #16 Sep 28 2018 18:46:46
%S A134734 2,3,1,5,3,1,1,1,1,11,3,1,1,1,1,1,1,1,1,1,1,23,3,1,1,1,1,1,1,1,1,1,1,
%T A134734 1,1,1,1,1,1,1,1,1,1,1,1,47,3,1,5,3,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%U A134734 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,101,3,1,1
%N A134734 First differences of A084662.
%D A134734 Eric S. Rowland, A simple prime-generating recurrence, Abstracts Amer. Math. Soc., 29 (No. 1, 2008), p. 50 (Abstract 1035-11-986).
%H A134734 Reinhard Zumkeller, <a href="/A134734/b134734.txt">Table of n, a(n) for n = 1..10000</a>
%H A134734 Eric S. Rowland, <a href="https://arxiv.org/abs/0710.3217">A simple prime-generating recurrence</a>, arXiv:0710.3217 [math.NT], 2007-2008.
%F A134734 a(n) = A132199(n), n > 2. - _R. J. Mathar_, Mar 28 2012
%t A134734 b[1] = 4; b[n_] := b[n] = b[n-1] + GCD[n, b[n-1]];
%t A134734 Table[b[n], {n, 104}] // Differences (* _Jean-François Alcover_, Sep 28 2018 *)
%o A134734 (Haskell)
%o A134734 a134734 n = a134734_list !! (n-1)
%o A134734 a134734_list = zipWith (-) (tail a084662_list) a084662_list
%o A134734 -- _Reinhard Zumkeller_, Nov 15 2013
%Y A134734 See A106108 for other cross-references.
%Y A134734 Cf. A132199, A134743, A134744.
%K A134734 nonn
%O A134734 1,1
%A A134734 _N. J. A. Sloane_, Jan 28 2008