id:A161872 - OEIS Search Results

Search: id:A161872

Displaying 1-1 of 1 results found.

page 1

Smallest unhappy number in base n (or 0 if no unhappy numbers in the base).

+0
1

0, 2, 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 7, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 (list; graph; listen)

	OFFSET	`2,2`
	COMMENT	`All positive integers are happy numbers in base 2 and base 4; they are called "happy bases". There are no other happy bases < 500,000,000.`
	CROSSREFS	`Cf. A031177 (Unhappy numbers in base 10)` `Sequence in context: A044948 A044949 A044950 this_sequence A036461 A063088 A101276` `Adjacent sequences: A161869 A161870 A161871 this_sequence A161873 A161874 A161875`
	KEYWORD	`nonn`
	AUTHOR	`Jud McCranie (judmccranie(AT)ugaalum.uga.edu), Jun 20 2009`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research