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.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175824 Maximum unsigned integer that can be stored in n bytes. 2
0, 255, 65535, 16777215, 4294967295, 1099511627775, 281474976710655, 72057594037927935, 18446744073709551615, 4722366482869645213695, 1208925819614629174706175, 309485009821345068724781055 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
All a(n) for n > 0 are Mersenne numbers. None are Mersenne primes.
LINKS
Wikipedia, Byte
Wikipedia, Mersenne prime
FORMULA
a(n) = 2^(8*n) - 1.
a(n) = (A001025(n) - 1) * (A024036(n)^2 + A004171(n)); this relation is (x^(8*n)-1) = (x^(4*n)-1)*((x^(2*n)-1)^2 + 2*x^(2*n)) for x=2. [Reinhard Zumkeller, Jun 23 2011]
EXAMPLE
a(0) = 2^0 - 1 = 1 - 1 = 0
a(1) = 2^8 - 1 = 256 - 1 = 255
a(2) = 2^16 - 1 = 65536 - 1 = 65535
a(3) = 2^24 - 1 = 16777216 - 1 = 16777215
MATHEMATICA
Table[2^(8n) - 1, {n, 0, 11}]
PROG
(Python)
print([2**(8 * i) - 1 for i in range(12)])
CROSSREFS
Cf. A000225. Equals A133752 minus one.
Sequence in context: A022190 A267545 A069383 * A238996 A069409 A069435
KEYWORD
easy,nonn
AUTHOR
Grant Garcia, Sep 13 2010
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 23:22 EDT 2024. Contains 372535 sequences. (Running on oeis4.)