A108068 - OEIS

This site is supported by donations to The OEIS Foundation.

A108068

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

4, 4, 0, 1, 0, 4, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 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,1`
	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	`lim sup_{n->infinity} a(n) = 6 [Kane]` `Conjecture: max_{n->infinity} a(n) = 6 [Kane]`
	EXAMPLE	`1 = 0!0! = 0!1! = 1!0! = 1!1!, so a(1) = 4.`
	CROSSREFS	`Cf. A108069.` `Sequence in context: A156450 A067007 A066298 * A131124 A131125 A187149` `Adjacent sequences: A108065 A108066 A108067 * A108069 A108070 A108071`
	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 15 17:13 EST 2012. Contains 205828 sequences.