login
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

%I #27 Apr 30 2019 11:23:12

%S 0,0,6,24,80,272,896,3584,15360,65280,270336,1081344,4259840,16781312,

%T 66584576,266338304,1069547520,4294901760,17213423616,68853694464,

%U 275146342400,1099512676352,4395899027456,17583596109824,70351564308480,281474959933440

%N 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.

%H Max Alekseyev, <a href="http://home.gwu.edu/~maxal/gpscripts/">PARI/GP scripts for miscellaneous math problems</a>

%H F. Ruskey, <a href="http://combos.org/TSstringS4">4-ary strings with given trace and subtrace</a>

%F 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).

%F Empirical g.f.: 2*x^3*(16*x^4-8*x^3-16*x^2+12*x-3) / ((4*x-1)*(8*x^2-4*x+1)*(16*x^4+1)). - _Colin Barker_, Dec 06 2014

%Y Cf. A068620, A068774, A068777, A068786, A068778, A068787, A068788, A068789, A068790.

%K nonn,base

%O 1,3

%A _Frank Ruskey_, Mar 29 2002

%E Terms a(11) onward from _Max Alekseyev_, Apr 09 2013