cp's OEIS Frontend

A134743 First differences of A134736.

%I A134743 #15 Jan 25 2022 12:24:32
%S A134743 1,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 A134743 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 A134743 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 A134743 First differences of A134736.
%D A134743 Eric S. Rowland, A simple prime-generating recurrence, Abstracts Amer. Math. Soc., 29 (No. 1, 2008), p. 50 (Abstract 1035-11-986).
%H A134743 Reinhard Zumkeller, <a href="/A134743/b134743.txt">Table of n, a(n) for n = 1..10000</a>
%H A134743 Eric S. Rowland, <a href="https://arxiv.org/abs/0710.3217">A natural prime-generating recurrence</a>, arXiv:0710.3217 [math.NT], 2007-2008.
%F A134743 a(n) = A132199(n), n>2. [_R. J. Mathar_, Dec 13 2008]
%t A134743 b[1] = 5; b[n_] := b[n] = b[n-1] + GCD[n, b[n-1]];
%t A134743 Array[b, 104] // Differences (* _Jean-François Alcover_, Oct 01 2018 *)
%o A134743 (Haskell)
%o A134743 a134743 n = a134743_list !! (n-1)
%o A134743 a134743_list = zipWith (-) (tail a134736_list) a134736_list
%o A134743 -- _Reinhard Zumkeller_, Nov 15 2013
%Y A134743 See A106108 for other cross-references.
%Y A134743 Cf. A134734, A134744.
%K A134743 nonn
%O A134743 1,2
%A A134743 _N. J. A. Sloane_, Jan 28 2008