The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 2
 0, 0, 32, 192, 0, 1408, 1024, 0, 12544, 9728, 512, 132608, 94720, 8192 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS 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 LINKS Table of n, a(n) for n=1..14. Dragomir Z. Dokovic, Equivalence classes and representatives of Golay sequences, Discrete Math. 189 (1998), no. 1-3, 79-93. MR1637705 (99j:94031). CROSSREFS Cf. A185064, A208924, A208926, A208927, A208928, A208929. Sequence in context: A317236 A233387 A200840 * A212863 A019560 A130811 Adjacent sequences: A208922 A208923 A208924 * A208926 A208927 A208928 KEYWORD nonn,more AUTHOR N. J. A. Sloane, Mar 03 2012 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.

Last modified August 15 19:07 EDT 2024. Contains 375173 sequences. (Running on oeis4.)