id:A007912 - OEIS Search Results

Search: id:A007912

Displaying 1-1 of 1 results found.

page 1

Quantum factorials: (n-1)!!-(n-2)!! (mod n).

+0
2

1, 1, 0, 1, 5, 1, 0, 1, 2, 3, 0, 1, 0, 1, 0, 9, 2, 15, 0, 1, 2, 9, 0, 1, 0, 7, 0, 15, 2, 1, 0, 1, 0, 27, 0, 1, 0, 25, 0, 21, 2, 11, 0, 1, 45, 33, 0, 25, 0, 39, 0, 27, 0, 49, 0, 1, 57, 15, 0, 1, 0, 1, 0, 33, 2, 51, 0, 35, 2, 9, 0, 1, 0, 19, 0, 39, 77, 65, 0, 1, 81, 63, 0, 1, 0, 33, 0, 45, 0 (list; graph; listen)

	OFFSET	`3,5`
	REFERENCES	`S. P. Hurd and J. S. McCranie, Quantum factorials. Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994). Congr. Numer. 104 (1994), 19-24.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=3..2000`
	CROSSREFS	`Cf. A007911.` `Sequence in context: A098173 A058177 A079508 this_sequence A019755 A085475 A157012` `Adjacent sequences: A007909 A007910 A007911 this_sequence A007913 A007914 A007915`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`J. H. Conway (conway(AT)math.princeton.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research