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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264605 Number of self-dual negacyclic codes of length 4n over GF(3), where 4n runs through the numbers congruent to 4 or 8 mod 12 (cf. A092259). 1
2, 2, 2, 8, 8, 2, 32, 8, 32, 8, 2, 8, 8, 32, 8, 8, 32, 32, 8, 8, 8, 2, 32, 512, 32, 8, 32, 2048, 8, 8, 8, 8, 32, 512 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..34.

Amita Sahni and Poonam Trama Sehgal, Enumeration of self-dual and self-orthogonal negacyclic codes over finite fields, Advances in Mathematics of Communications, Volume 9, No. 4, 2015, 437-447.

CROSSREFS

Cf. A092259.

Sequence in context: A185811 A011140 A171715 * A353245 A275928 A221072

Adjacent sequences: A264602 A264603 A264604 * A264606 A264607 A264608

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Nov 24 2015

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 December 8 11:55 EST 2022. Contains 358693 sequences. (Running on oeis4.)