OFFSET
0,3
COMMENTS
Every nonzero term is relatively prime to all others (which proves that there are infinitely many primes). See A236394 for the primes that appear.
LINKS
R. Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv preprint arXiv:1202.3670 [math.HO], 2012. - N. J. A. Sloane, Jun 13 2012
Michael Somos and R. Haas, A linked pair of sequences implies the primes are infinite, Amer. Math. Monthly, 110(6) (2003), 539-540.
FORMULA
a(n) = (a(n-1)^2 + a(n-2)^2 - a(n-1) * a(n-2) * (1 + a(n-2))) / (1 - a(n-2)) for n >= 2.
a(n) ~ c^(phi^n), where c = 1.2364241784241086061606568429916822975882631646194967549068405592472125928485... and phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - Vaclav Kotesovec, May 21 2015
MATHEMATICA
Flatten[{0, 1, RecurrenceTable[{a[n]==(a[n-1]^2 + a[n-2]^2 - a[n-1]*a[n-2] * (1+a[n-2]))/(1-a[n-2]), a[2]==2, a[3]==3}, a, {n, 2, 15}]}] (* Vaclav Kotesovec, May 21 2015 *)
PROG
(PARI) {a(n) = local(v); if( n<3, max(0, n), v = [1, 1]; for( k=3, n, v = [v[2], v[1] * (v[1] + v[2])]); v[1] + v[2])}
(PARI) {a(n) = if( n<4, max(0, n), (a(n-1)^2 + a(n-2)^2 - a(n-1) * a(n-2) * (1 + a(n-2))) / (1 - a(n-2)))}
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Michael Somos, Oct 07 2001
STATUS
approved