A108069 - OEIS

This site is supported by donations to The OEIS Foundation.

A108069

Number of ordered pairs (i,j) with i>=1, j>=1 and i!*j! = n.

1, 2, 0, 1, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	LINKS	`D. M. Kane, On the number of ways of writing T as a product of factorials, Integers: Electronic Journal of Combinatorial Number Theory, 5 (2005), #A02, 10pp.`
	FORMULA	`Conjecture: max_{n->infinity} a(n) = 4 [Kane]`
	EXAMPLE	`1 = 1!1!, so a(1) = 1; 2 = 0!2! = 1!2! = 2!0! = 2!*1!, so a(2) = 4.`
	CROSSREFS	`Cf. A108068.` `Sequence in context: A112517 A112519 A091728 * A089734 A035177 A194591` `Adjacent sequences: A108066 A108067 A108068 * A108070 A108071 A108072`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jun 04 2005`
	EXTENSIONS	`More terms from Christian G. Bower (bowerc(AT)usa.net), Jun 04 2005`

Content is available under The OEIS End-User License Agreement .

Last modified February 13 20:37 EST 2012. Contains 205554 sequences.