Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145503
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A145503
%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. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Mar 18 2009]
%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}] (*Artur 
               Jasinski*)
%Y A145503 A145502-A145511
%Y A145503 Sequence in context: A117808 A002065 A087601 this_sequence A112093 A085010 
               A165903
%Y A145503 Adjacent sequences: A145500 A145501 A145502 this_sequence A145504 A145505 
               A145506
%K A145503 nonn
%O A145503 1,1
%A A145503 Artur Jasinski (grafix(AT)csl.pl), Oct 11 2008

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research