Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068786
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068786 S(n; 1,0) = S(n; 3,0) 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
1, 2, 6, 16, 40, 192, 896, 4096, 17536, 69632 (list; graph; listen)
OFFSET

1,2

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

Sequence in context: A111281 A018021 A074405 this_sequence A102699 A025169 A111282

Adjacent sequences: A068783 A068784 A068785 this_sequence A068787 A068788 A068789

KEYWORD

nonn

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research