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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 9
0, 0, 0, 16, 80, 320, 1184, 4096, 15360, 61440 (list; graph; refs; listen; history; internal format)
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 * A034570 A165963 A069840

Adjacent sequences:  A068775 A068776 A068777 * A068779 A068780 A068781

KEYWORD

nonn,base

AUTHOR

Frank Ruskey (ruskey(AT)cs.uvic.ca), Mar 29 2002

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 17 11:46 EST 2012. Contains 206011 sequences.