A208926 -id:A208926 - cp's OEIS frontend

A208924 Let L = A185064(n) be the n-th length for which a Golay sequence exists; a(n) = number of Golay sequences of length L.

Original entry on oeis.org

4, 8, 32, 192, 128, 1536, 1088, 64, 15360, 9728, 512, 184320, 102912

Offset: 1

N. J. A. Sloane, Mar 03 2012

Dragomir Z. Dokovic, Equivalence classes and representatives of Golay sequences, Discrete Math. 189 (1998), no. 1-3, 79-93. MR1637705 (99j:94031).
Matthew G. Parker, Kenneth G. Paterson, and Chintha Tellambura, Golay Complementary Sequences, in Wiley Encyclopedia of Telecommunications, John G. Proakis, ed., Wiley, 2003; alternate link, January 19, 2004. See Table 1 p. 7.

Cf. A185064, A208925, A208926, A208927, A208928, A208929.

a(n) = A208925(n) + A208926(n).

a(11)-a(13) from Vincenzo Librandi, Nov 26 2020

A208925 Let L = A185064(n) be the n-th length for which a Golay sequence exists; a(n) = number of constructable Golay sequences of length L.

Original entry on oeis.org

0, 0, 32, 192, 0, 1408, 1024, 0, 12544, 9728, 512, 132608, 94720, 8192

Offset: 1

N. J. A. Sloane, Mar 03 2012

The definition sounds paradoxical: how can a(n) possibly be zero? The answer seems to be that a Golay sequence of length L can exist without being "constructable"! - N. J. A. Sloane, Nov 26 2020

Dragomir Z. Dokovic, Equivalence classes and representatives of Golay sequences, Discrete Math. 189 (1998), no. 1-3, 79-93. MR1637705 (99j:94031).

Cf. A185064, A208924, A208926, A208927, A208928, A208929.

cp's OEIS Frontend

A208924 Let L = A185064(n) be the n-th length for which a Golay sequence exists; a(n) = number of Golay sequences of length L.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions