login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007968 Type of happy factorization of n. 12
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; text; internal format)
OFFSET

0,4

COMMENTS

a(A000290(n)) = 0; a(A007969(n)) = 1; a(A007920(n)) = 2.

LINKS

Table of n, a(n) for n=0..104.

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)

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified May 24 15:56 EDT 2013. Contains 225624 sequences.