id:A052010 - OEIS Search Results

Search: id:A052010

Displaying 1-1 of 1 results found.

page 1

A052010

Smallest k such that the sum of the digits of n each raised to k-th power is greater than n, or 0 if no such k exists.

+0
1

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

	OFFSET	`0,3`
	EXAMPLE	`E.g. 103 needs k at least equal to 5 because 1^5+0^5+3^5 = 244 > 103.`
	CROSSREFS	`Sequence in context: A037815 A117005 A115230 this_sequence A138471 A102669 A055098` `Adjacent sequences: A052007 A052008 A052009 this_sequence A052011 A052012 A052013`
	KEYWORD	`nonn,base`
	AUTHOR	`Patrick De Geest (pdg(AT)worldofnumbers.com), Nov 15 1999.`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research