login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209248 a(n) = 2^(2^n - 2*n - 1). 0
2, 128, 2097152, 2251799813685248, 10384593717069655257060992658440192, 883423532389192164791648750371459257913741948437809479060803100646309888 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

COMMENTS

a(n) = 2^A070313(n). Krotov on p. 2: "in general, two extended Hamming codes can intersect in 2^(2^m - 2m - 1) elements."

LINKS

Table of n, a(n) for n=3..8.

Denis Krotov, A partition of the hypercube into cosets of maximally nonparallel Hamming codes, arXiv:1210.0010v1 [cs.IT], 2012-2016.

Index to divisibility sequences

EXAMPLE

a(5) = 2^(2^5 - 2*5 - 1) = 2^21 = 2097152.

MATHEMATICA

Table[2^(2^n - 2n - 1), {n, 3, 15}] (* Alonso del Arte, Jan 13 2013 *)

PROG

(PARI) 1<<(2^n-2*n-1) \\ Charles R Greathouse IV, Jan 24 2013

(Maxima) makelist(floor(2^(2^n-2*n-1)), n, 3, 8); /* Martin Ettl, Jan 25 2013 */

CROSSREFS

Cf. A070313.

Sequence in context: A024345 A012524 A012670 * A153425 A296060 A090121

Adjacent sequences:  A209245 A209246 A209247 * A209249 A209250 A209251

KEYWORD

nonn,easy

AUTHOR

Jonathan Vos Post, Jan 13 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 04:36 EDT 2020. Contains 334671 sequences. (Running on oeis4.)