cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A145503 a(n+1) = a(n)^2+2*a(n)-2 and a(1)=3.

This page as a plain text file.
%I A145503 #14 Feb 01 2018 02:18:49
%S A145503 3,13,193,37633,1416317953,2005956546822746113,
%T A145503 4023861667741036022825635656102100993
%N A145503 a(n+1) = a(n)^2+2*a(n)-2 and a(1)=3.
%C A145503 General formula for a(n+1)=a(n)^2+2*a(n)-2 and a(1)=k+1 is a(n)=Floor[((k + Sqrt[k^2 + 4])/2)^(2^((n+1) - 1)).
%C A145503 Essentially the same as A110407. [_R. J. Mathar_, Mar 18 2009]
%H A145503 Indranil Ghosh, <a href="/A145503/b145503.txt">Table of n, a(n) for n = 1..11</a>
%F A145503 From _Peter Bala_, Nov 12 2012: (Start)
%F A145503 a(n) = alpha^(2^(n-1)) + (1/alpha)^(2^(n-1)) - 1, where alpha := 2 + sqrt(3).
%F A145503 a(n) = A003010(n-1) - 1. a(n) = 2*A002812(n-1) - 1.
%F A145503 Recurrence: a(n) = 5*(Product {k = 1..n-1} a(k)) - 2 with a(1) = 3.
%F A145503 Product_{n >= 1} (1 + 1/a(n)) = 5/6*sqrt(3).
%F A145503 Product_{n >= 1} (1 + 2/(a(n) + 1)) = sqrt(3).
%F A145503 (End)
%t A145503 aa = {}; k = 3; Do[AppendTo[aa, k]; k = k^2 + 2 k - 2, {n, 1, 10}]; aa
%t A145503 (* or *)
%t A145503 k = 2; Table[Floor[((k + Sqrt[k^2 + 4])/2)^(2^(n - 1))], {n, 2, 7}]
%t A145503 NestList[#^2+2#-2&,3,10] (* _Harvey P. Dale_, Feb 01 2018 *)
%Y A145503 Cf. A145502-A145510. A003010, A002812.
%K A145503 nonn,easy
%O A145503 1,1
%A A145503 _Artur Jasinski_, Oct 11 2008