The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

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

%I #21 Jun 06 2019 09:56:22

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 15 09:26 EDT 2024. Contains 373407 sequences. (Running on oeis4.)