Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073998
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073998 Number of strings of length n over GF(4) with trace 1 and subtrace 1. +0
5
0, 2, 7, 16, 60, 272, 1072, 4096, 16320, 65792, 262912, 1048576, 4193280, 16781312, 67121152 (list; graph; listen)
OFFSET

1,2

COMMENT

Same as the number of strings of length n over GF(4) with trace x and subtrace y where x=RootOf(z^2+z+1) and y=1+x. Same as the number of strings of length n over GF(4) with trace y and subtrace 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.: -(2*q^2+5*q-2)*q^2/[(1-2q)(1-4q)(1+4q^2)]. - Lawrence Sze, Oct 24 2004

EXAMPLE

a(2; x,y)=2 since the two 4-ary strings of trace x, subtrace y and length 2 are { 1y, y1 }.

CROSSREFS

Cf. A073995, A073996, A073997, A073999, A074000.

Sequence in context: A000512 A084079 A042689 this_sequence A129444 A079815 A006883

Adjacent sequences: A073995 A073996 A073997 this_sequence A073999 A074000 A074001

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research