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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212739 a(n) = 2^(n^2) - 1. 0
0, 1, 15, 511, 65535, 33554431, 68719476735, 562949953421311, 18446744073709551615, 2417851639229258349412351, 1267650600228229401496703205375, 2658455991569831745807614120560689151, 22300745198530623141535718272648361505980415 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Number of grains for squared chessboards.

LINKS

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

Wikipedia, Wheat and chessboard problem

FORMULA

a(n) = 2^(n^2) - 1 = A002416(n) - 1. - Omar E. Pol, Jun 11 2012

EXAMPLE

For usual 8×8 chessboard there are 2^{64}-1 = 18446744073709551615 grains.

MAPLE

a:= n-> 2^(n^2)-1:

seq(a(n), n=0..15);

CROSSREFS

Cf. A000225, A002416.

Sequence in context: A218280 A218632 A218235 * A009068 A268960 A157166

Adjacent sequences:  A212736 A212737 A212738 * A212740 A212741 A212742

KEYWORD

nonn

AUTHOR

Jani Melik, Jun 06 2012

EXTENSIONS

Better name from Omar E. Pol, Jun 11 2012

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 December 3 23:53 EST 2020. Contains 338920 sequences. (Running on oeis4.)