login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073589 a(n)=a(n-1)^2*2^n-1 where a(0)=1. 0
1, 1, 3, 71, 80655, 208167328799, 2773352753875902386073663, 984510143671174604457027747023105816438433566408831, 248130617085807836435043583698283293120315590212520216226461514224419945596690035680296658588117705359615 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

The next term has 212 digits. - Harvey P. Dale, Dec 05 2018

LINKS

Table of n, a(n) for n=0..8.

MATHEMATICA

RecurrenceTable[{a[0]==1, a[n]==a[n-1]^2 2^n-1}, a, {n, 9}] (* Harvey P. Dale, Dec 05 2018 *)

PROG

(BASIC)

20 A=1

25 print A

30 for I=1 to 20

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

50 print A

60 next

70 end

(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

CROSSREFS

Sequence in context: A300540 A334124 A336441 * A089537 A321530 A062074

Adjacent sequences:  A073586 A073587 A073588 * A073590 A073591 A073592

KEYWORD

easy,nonn

AUTHOR

Felice Russo, Aug 28 2002

EXTENSIONS

a(0)=1 prepended by Michel Marcus, Sep 28 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 1 02:32 EST 2021. Contains 341732 sequences. (Running on oeis4.)