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.

A145505 a(n+1)=a(n)^2+2*a(n)-2 and a(1)=5.

This page as a plain text file.
%I A145505 #12 Jun 02 2025 00:39:39
%S A145505 5,33,1153,1331713,1773462177793,3145168096065837266706433,
%T A145505 9892082352510403757550172975146702122837936996353
%N A145505 a(n+1)=a(n)^2+2*a(n)-2 and a(1)=5.
%C A145505 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))
%F A145505 From Peter Bala, Nov 12 2012: (Start)
%F A145505 a(n) = alpha^(2^(n-1)) + (1/alpha)^(2^(n-1)) - 1, where alpha := 3 + 2*sqrt(2).
%F A145505 a(n) = (1 + sqrt(2))^(2^n) + (sqrt(2) - 1)^(2^n) - 1.
%F A145505 a(n) = A003423(n-1) - 1. a(n) = 2*A001601(n) - 1. a(n) = 4*A190840(n-1) + 1.
%F A145505 Recurrence: a(n) = 7*{product {k = 1..n-1} a(k)} - 2 with a(1) = 5.
%F A145505 Product {n = 1..inf} (1 + 1/a(n)) = 7/8*sqrt(2).
%F A145505 Product {n = 1..inf} (1 + 2/(a(n) + 1)) = sqrt(2).
%F A145505 (End)
%t A145505 aa = {}; k = 5; Do[AppendTo[aa, k]; k = k^2 + 2 k - 2, {n, 1, 10}]; aa
%t A145505 or
%t A145505 k =4; Table[Floor[((k + Sqrt[k^2 + 4])/2)^(2^(n - 1))], {n, 2, 7}] (*Artur Jasinski*)
%t A145505 NestList[#^2+2#-2&,5,7]  (* _Harvey P. Dale_, Mar 19 2011 *)
%Y A145505 A145502-A145510. A003423, A001601, A190840.
%K A145505 nonn
%O A145505 1,1
%A A145505 _Artur Jasinski_, Oct 11 2008