login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073996 Number of strings of length n over GF(4) with trace 0 and subtrace 1. 4
0, 0, 1, 3, 12, 60, 256, 1008, 4032, 16320, 65536, 261888, 1047552, 4193280, 16777216, 67104768, 268419072, 1073725440, 4294967296, 17179803648, 68719214592 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

Same as the number of strings of length n over GF(4) with trace 0 and subtrace x where x=RootOf(z^2+z+1). Same as the number of strings of length n over GF(4) with trace 0 and subtrace y where y=1+x.

LINKS

F. Ruskey Number of strings over GF(4) of given trace and subtrace

FORMULA

a(n; t, s) = a(n-1; t, s) + a(n-1; t-1, s-(t-1)) + a(n-1; t-2, s-2(t-2)) + a(n-1; t-3, s-3(t-3)) where t is the trace and s is the subtrace. Note that all operations involving operands t or s are carried out over GF(4).

G.f.: (6*q^2-3*q+1)*q^2/[(1-2q)(1-4q)(1+4q^2)]. - Lawrence Sze, Oct 24 2004

EXAMPLE

a(2;0,1)=1 since the one 4-ary string of trace 0, subtrace 1 and length 2 is { 11 }.

MATHEMATICA

CoefficientList[Series[x^2 (6x^2-3x+1)/((1-2x)(1-4x)(1+4x^2)), {x, 0, 30}], x]  (* From Harvey P. Dale, Apr 03 2011 *)

CROSSREFS

Cf. A073995, A073997, A073998, A073999, A074000.

Sequence in context: A090830 A127918 A069944 * A003483 A128602 A092803

Adjacent sequences:  A073993 A073994 A073995 * A073997 A073998 A073999

KEYWORD

easy,nonn

AUTHOR

Frank Ruskey, Nate Kube (ruskey(AT)cs.uvic.ca), Aug 16 2002

EXTENSIONS

More terms from Harvey P. Dale, Apr 03 2011.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:45 EST 2012. Contains 205860 sequences.