A007968 - OEIS

This site is supported by donations to The OEIS Foundation.

A007968

Type of happy factorization of n.

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

	OFFSET	`0,4`
	COMMENTS	`a(A000290(n)) = 0; a(A007969(n)) = 1; a(A007920(n)) = 2.`
	LINKS	`J. H. Conway, On Happy Factorizations, J. Integer Sequences, Vol. 1, 1998, #1.` `Reinhard Zumkeller, Initial Happy Factorization Data for n <= 250`
	CROSSREFS	`Sequence in context: A048881 A026931 A127506 * A077763 A030218 A127440` `Adjacent sequences: A007965 A007966 A007967 * A007969 A007970 A007971`
	KEYWORD	`nonn`
	AUTHOR	`J. H. Conway (conway(AT)math.princeton.edu)`

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

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.