Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073996
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073996 Number of strings of length n over GF(4) with trace 0 and subtrace 1. +0
5
0, 1, 3, 12, 60, 256, 1008, 4032, 16320, 65536, 261888, 1047552, 4193280, 16777216, 67104768 (list; graph; listen)
OFFSET

1,3

COMMENT

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 }.

CROSSREFS

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

Sequence in context: A090830 A127918 A069944 this_sequence A003483 A128602 A092803

Adjacent sequences: A073993 A073994 A073995 this_sequence A073997 A073998 A073999

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research