id:A114570 - OEIS Search Results

Search: id:A114570

Displaying 1-1 of 1 results found.

page 1

Let the decimal expansion of n be d_1 d_2 ... d_k; then a(n) = Sum_{i=1..k} d_i^(k+1-i}.

+0
1

1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 49, 50, 51, 52, 53, 54, 55, 56, 57 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Every number n (of two or more digits) is guaranteed to yield a smaller number a(n) since 9^k < 10^k This sequence is related to other sequences about sum of the digits or sum of powers of digits.`
	EXAMPLE	`E.g. a(1247) = 32 since 1^4 + 2^3 + 4^2 + 7^1 = 1 + 8 + 16 + 7 = 32.`
	MAPLE	`for n from 0 to 7 do seq(n^2+j^1, j=0..9 ); od; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 06 2006`
	CROSSREFS	`Sequence in context: A076314 A007953 A080463 this_sequence A115026 A101337 A135208` `Adjacent sequences: A114567 A114568 A114569 this_sequence A114571 A114572 A114573`
	KEYWORD	`nonn,base`
	AUTHOR	`Sergio Pimentel (ferdiego(AT)cox.net), Feb 16 2006`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research