Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068778
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068778 S(n; 1,1) = S(n; 3,1) where S(n; t,s) is the number of length n 4-ary strings whose digits sum to t mod 4 and whose sum of products of all pairs of digits sum to s mod 4. +0
10
0, 0, 0, 16, 80, 320, 1184, 4096, 15360, 61440 (list; graph; listen)
OFFSET

1,4

LINKS

F. Ruskey, 4-ary strings with given trace and subtrace.

FORMULA

S(n; t, s) = S(n-1; t, s) + S(n-1; t+3, s+3t+1) + S(n-1; t+2, s+2t) + S(n-1; t+1, s+t+1)

CROSSREFS

Cf. A073953, A068711, A073955, A068777, A068786, A073959, A068788, A068789, A073962.

Sequence in context: A008511 A130810 A050468 this_sequence A034570 A165963 A069840

Adjacent sequences: A068775 A068776 A068777 this_sequence A068779 A068780 A068781

KEYWORD

nonn,base

AUTHOR

Frank Ruskey (fruskey(AT)cs.uvic.ca), Mar 29 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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research