The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A212739 revision #23

A212739

a(n) = 2^(n^2) - 1.

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 X 8 chessboard there are 2^64 - 1 = 18446744073709551615 grains.