|
| |
|
|
A114570
|
|
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}.
|
|
2
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| 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) = 1^4 + 2^3 + 4^2 + 7^1 = 1 + 8 + 16 + 7 = 32.
|
|
|
MAPLE
| A114570 := proc(n) local L; L := convert(n, base, 10) ; add( op(i, L)^i, i=1..nops(L)) ; end proc: # R. J. Mathar, Dec 20 2010
|
|
|
MATHEMATICA
| f[n_] := Block[{id = IntegerDigits@ n}, Plus @@ (id^Reverse@ Range@ Length@ id)]; Array[f, 78]
|
|
|
PROG
| (Sage) A114570 = lambda n: sum(d**i for i, d in enumerate(n.digits(), 1)) # [D. S. McNeil, Dec 21 2010]
|
|
|
CROSSREFS
| Sequence in context: A076314 A007953 A080463 * A115026 A101337 A135208
Adjacent sequences: A114567 A114568 A114569 * A114571 A114572 A114573
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Sergio Pimentel (ferdiego(AT)cox.net), Feb 16 2006
|
| |
|
|
