OFFSET
0,3
LINKS
E. S. Rowland, A natural prime-generating recurrence, arXiv:0710.3217 [math.NT]
FORMULA
a(n) = a(n-1) + a(n-2) + gcd(n,a(n-1)) - gcd(n,a(n-2)).
a(n) ~ c * phi^n, where phi = A001622 = (1 + sqrt(5))/2 is the golden ratio and c = 0.3434866160389779937344617212678945874922532000472607933856634329169... - Vaclav Kotesovec, Dec 03 2017
MAPLE
A139759 := proc(n) option remember ; if n <= 1 then 1; else an_1 := A139759(n-1) ; an_2 := A139759(n-2) ; an_1+an_2+gcd(n, an_1)-gcd(n, an_2) ; fi ; end: seq(A139759(n), n=0..60) ; # R. J. Mathar, May 20 2008
MATHEMATICA
a[0]=a[1]=1; a[n_] := a[n] = a[n-1]+a[n-2]+GCD[n, a[n-1]] - GCD[n, a[n-2]];
Table[a[n], {n, 0, 60}] (* Jean-François Alcover, Dec 03 2017 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Ctibor O. Zizka, May 20 2008
EXTENSIONS
More terms from R. J. Mathar, May 20 2008
Converted reference to link - R. J. Mathar, Oct 30 2009
STATUS
approved