The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A167053 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A167053

a(1)=3; for n > 1, a(n) = 1 + a(n-1) + gcd( a(n-1)*(a(n-1)+2), A073829(a(n-1)) ).
(history; published version)

#21 by Amiram Eldar at Tue Nov 07 03:15:42 EST 2023

STATUS

reviewed

approved

#20 by Stefano Spezia at Tue Nov 07 01:07:09 EST 2023

STATUS

proposed

reviewed

#19 by Michel Marcus at Tue Nov 07 01:06:01 EST 2023

STATUS

editing

proposed

#18 by Michel Marcus at Tue Nov 07 01:05:58 EST 2023

REFERENCES

E. Trost, Primzahlen, BirkhauserBirkhäuser-Verlag, 1953, pages 30-31.

STATUS

approved

editing

#17 by Michel Marcus at Wed Mar 25 06:03:59 EDT 2020

STATUS

reviewed

approved

#16 by Peter Luschny at Wed Mar 25 04:46:45 EDT 2020

STATUS

proposed

reviewed

#15 by Jean-François Alcover at Wed Mar 25 03:40:41 EDT 2020

STATUS

editing

proposed

#14 by Jean-François Alcover at Wed Mar 25 03:40:36 EDT 2020

MATHEMATICA

A073829[n_] := 4((n-1)! + 1) + n;

a[1] = 3;

a[n_] := a[n] = 1 + a[n-1] + GCD[a[n-1] (a[n-1] + 2), A073829[a[n-1]]];

Array[a, 60] (* Jean-François Alcover, Mar 25 2020 *)

STATUS

approved

editing

#13 by Susanna Cuyler at Fri Sep 13 08:04:03 EDT 2019

STATUS

reviewed

approved

#12 by Michel Marcus at Fri Sep 13 04:40:10 EDT 2019

STATUS

proposed

reviewed