Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133752
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133752 a(n) = 256^n. +0
1
1, 256, 65536, 16777216, 4294967296, 1099511627776, 281474976710656, 72057594037927936, 18446744073709551616, 4722366482869645213696, 1208925819614629174706176, 309485009821345068724781056 (list; graph; listen)
OFFSET

0,2

COMMENT

Number of different possible values that a file of n bytes can have. Considering each byte has 8 bits and each bit can be 0 or 1. The sequence starts with one byte, then two bytes, then three bytes, and so on... where n is the number of bytes.

The sequence shows how many different files can exist even considering very low amount of data (just a few bytes). Considering just 5 bytes of data, there are 1,099,511,627,776 different possible files.

EXAMPLE

a(1) = 256^1 = 256 --> there are 256 possible 1 byte files

a(2) = 256^2 = 65536 --> there are 65536 possible 2 byte files

a(3) = 256^3 = 16777216 --> there are 16777216 possible 3 byte files

a(4) = 256^4 = 4294967296 --> there are 4294967296 possible 4 byte files

a(5) = 256^5 = 1099511627776 --> there are 1099511627776 possible 5 byte files

CROSSREFS

Sequence in context: A017440 A017572 A016748 this_sequence A144322 A013997 A118056

Adjacent sequences: A133749 A133750 A133751 this_sequence A133753 A133754 A133755

KEYWORD

easy,nonn

AUTHOR

Marcel Hetkowski Fabeny (marcelfabeny(AT)yahoo.com.br), Jan 01 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 21:35 EST 2008. Contains 151309 sequences.


AT&T Labs Research