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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068711 S(n; 0,1) = S(n; 2,3) 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, 6, 24, 80, 272, 896, 3584, 15360, 65280 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

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, A073955, A068777, A068786, A068778, A073959, A068788, A068789, A073962.

Sequence in context: A004404 A201189 A001788 * A047790 A133474 A052150

Adjacent sequences:  A068708 A068709 A068710 * A068712 A068713 A068714

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 07:41 EST 2012. Contains 205998 sequences.