login
a(n)=a(n-1)^2*2^n-1 where a(0)=1.
0

%I #12 Dec 05 2018 14:40:47

%S 1,1,3,71,80655,208167328799,2773352753875902386073663,

%T 984510143671174604457027747023105816438433566408831,

%U 248130617085807836435043583698283293120315590212520216226461514224419945596690035680296658588117705359615

%N a(n)=a(n-1)^2*2^n-1 where a(0)=1.

%C The next term has 212 digits. - _Harvey P. Dale_, Dec 05 2018

%t RecurrenceTable[{a[0]==1,a[n]==a[n-1]^2 2^n-1},a,{n,9}] (* _Harvey P. Dale_, Dec 05 2018 *)

%o (BASIC)

%o 20 A=1

%o 25 print A

%o 30 for I=1 to 20

%o 40 A=(A^2)*2^I-1

%o 50 print A

%o 60 next

%o 70 end

%o (PARI) lista(nn) = {my(v = 1); print1(v, ", "); for (n=1, nn, v = v^2*2^n-1; print1(v, ", "););} \\ _Michel Marcus_, Sep 28 2013

%K easy,nonn

%O 0,3

%A _Felice Russo_, Aug 28 2002

%E a(0)=1 prepended by _Michel Marcus_, Sep 28 2013