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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212739 a(n) = 2^(n^2) - 1. 0

%I

%S 0,1,15,511,65535,33554431,68719476735,562949953421311,

%T 18446744073709551615,2417851639229258349412351,

%U 1267650600228229401496703205375,2658455991569831745807614120560689151,22300745198530623141535718272648361505980415

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

%C Number of grains for squared chessboards.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Wheat_and_chessboard_problem">Wheat and chessboard problem</a>

%F a(n) = 2^(n^2) - 1 = A002416(n) - 1. - _Omar E. Pol_, Jun 11 2012

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

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

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

%Y Cf. A000225, A002416.

%K nonn

%O 0,3

%A _Jani Melik_, Jun 06 2012

%E Better name from _Omar E. Pol_, Jun 11 2012

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 January 18 14:07 EST 2021. Contains 340254 sequences. (Running on oeis4.)