id:A123298 - OEIS Search Results

Search: id:A123298

Displaying 1-1 of 1 results found.

page 1

a(n) = number of incongruent restricted disjoint covering systems (IRDCS) of length n. An IRDCS of length n is a sequence of n integers s(1),...,s(n) with the property that if s(i)=m for some m then the other members of the sequence with value m are precisely s(i+km) for all k such that i+km is in [1,n] and further such that any integer appearing in the sequence appears at least twice. For example the two IRDCS of length n are 6,9,3,4,5,3,6,4,3,5,9 and its reverse.

+0
1

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 4, 6, 18, 14, 26, 84, 88, 46, 176, 380, 812, 844, 1770, 2164, 5554, 9244, 25384, 62092, 68176, 85762, 304892, 855072, 1229050, 1805096 (list; graph; listen)

	OFFSET	`1,11`
	REFERENCES	`Gerry Myerson, Jacky Poon and Jamie Simpson, Incongruent restricted disjoint covering systems, preprint.`
	CROSSREFS	`Sequence in context: A005871 A005888 A107499 this_sequence A110981 A019261 A019222` `Adjacent sequences: A123295 A123296 A123297 this_sequence A123299 A123300 A123301`
	KEYWORD	`nice,nonn`
	AUTHOR	`Jamie Simpson (simpson(AT)maths.curtin.edu.au), Jun 25 2007, corrected Sep 11 2007`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research