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

Last modified May 18 08:45 EDT 2024. Contains 372618 sequences. (Running on oeis4.)