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”).
reviewed
approved
proposed
reviewed
editing
proposed
2^Range[0, 12]^2 - 1 (* Paul F. Marrero Romero, Sep 30 2024 *)
approved
editing
editing
approved
For usual 8× X 8 chessboard there are 2^{64} - 1 = 18446744073709551615 grains.
approved
editing
editing
approved
Wikipedia, <a href="httphttps://en.wikipedia.org/wiki/Wheat_and_chessboard_problem">Wheat and chessboard problem</a>
approved
editing
editing
approved
stevilo_zrn_kv := proc(n) local i, an;
an := [ ]:
for i from 1 to n do
an := [op(an), (2^(i^(2))-1) ]:
oda:= n-> 2^(n^2)-1:
RETURN(an) end:
stevilo_zrn_kv(13);
seq(a(n), n=0..15);
approved
editing