A007966 - OEIS

This site is supported by donations to The OEIS Foundation.

A007966

First factor in happy factorization of n.

0, 1, 1, 1, 2, 1, 2, 7, 2, 3, 1, 1, 3, 1, 7, 3, 4, 1, 2, 1, 4, 3, 2, 23, 4, 5, 1, 1, 7, 1, 5, 31, 16, 11, 17, 5, 6, 1, 2, 3, 2, 1, 6, 1, 11, 5, 23, 47, 6, 7, 1, 1, 4, 1, 2, 11, 7, 3, 1, 1, 15, 1, 31, 7, 8, 1, 2, 1, 4, 23, 5, 71, 8, 1, 1, 25, 19, 7, 26, 79, 8, 9, 1, 1, 3, 1, 2, 3, 4, 1, 9 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,5`
	COMMENTS	`a(n) = n / A007967(n);` `a(A007969(n)) = A191854(n); a(A007970(n)) = A191856(n). [Reinhard Zumkeller, Jun 18 2011]`
	LINKS	`J. H. Conway, On Happy Factorizations, J. Integer Sequences, Vol. 1, 1998, #1.` `Initial Happy Factorization Data`
	CROSSREFS	`Cf. A191914.` `Sequence in context: A131057 A051852 A054495 * A011241 A167480 A021051` `Adjacent sequences: A007963 A007964 A007965 * A007967 A007968 A007969`
	KEYWORD	`nonn`
	AUTHOR	`J. H. Conway (conway(AT)math.princeton.edu)`

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

Last modified February 14 10:24 EST 2012. Contains 205614 sequences.