OFFSET
1,2
COMMENTS
This is a well-known sequence in the Bitcoin community.
In 2015, an anonymous Bitcoin user created a challenge or puzzle comprising 256 private keys of increasing size and transferred bitcoin amounts .001 through .256 to them.
The keys are apparently arbitrary values, apart from being in the range 2^(n-1) <= a(n) < 2^n, and the first person to find a key can take the bitcoin amount at that key.
LINKS
Darío Clavijo, Table of n, a(n) for n = 1..65.
Bitcointalk forum, Bitcoin puzzle transaction ~32 BTC prize to who solves it.
Blockchain.com, The original Bitcoin transaction.
privatekeys.pw, ~1000 BTC Bitcoin Challenge Transaction.
FORMULA
2^(n-1) <= a(n) < 2^(n).
CROSSREFS
KEYWORD
nonn,hard,fini,less
AUTHOR
Darío Clavijo, Feb 05 2024
STATUS
approved