A134734 First differences of A084662.

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, 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, 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

Offset: 1

Author

N. J. A. Sloane, Jan 28 2008

Keywords

• nonn

References

• Eric S. Rowland, A simple prime-generating recurrence, Abstracts Amer. Math. Soc., 29 (No. 1, 2008), p. 50 (Abstract 1035-11-986).

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
• Eric S. Rowland, A simple prime-generating recurrence, arXiv:0710.3217 [math.NT], 2007-2008.

Crossrefs

See A106108 for other cross-references.

Cf. A132199, A134743, A134744.

Programs

Haskell

a134734 n = a134734_list !! (n-1)
a134734_list = zipWith (-) (tail a084662_list) a084662_list
-- Reinhard Zumkeller, Nov 15 2013

Mathematica

b[1] = 4; b[n_] := b[n] = b[n-1] + GCD[n, b[n-1]];
Table[b[n], {n, 104}] // Differences (* Jean-François Alcover, Sep 28 2018 *)

Formula

a(n) = A132199(n), n > 2. - R. J. Mathar, Mar 28 2012