A062028 a(n) = n + sum of the digits of n.

0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 77

Offset

0,2

Comments

a(n) = A248110(n,A007953(n)). - Reinhard Zumkeller, Oct 01 2014

Links

Harry J. Smith and N. J. A. Sloane, Table of n, a(n) for n = 0..10000 (first 1000 terms were computed by Harry J. Smith)

Index entries for Colombian or self numbers and related sequences

Formula

a(n) = n + A007953(n).

a(n) = A160939(n+1) - 1. - Filip Zaludek, Oct 26 2016

Example

a(34) = 34 + 3 + 4 = 41, a(40) = 40 + 4 = 44.

Maple

with(numtheory): for n from 1 to 100 do a := convert(n, base, 10):
c := add(a[i], i=1..nops(a)): printf(`%d, `, n+c); od:
A062028 := n -> n+add(i, i=convert(n, base, 10)) # M. F. Hasler, Nov 08 2018

Mathematica

Table[n + Total[IntegerDigits[n]], {n, 0, 100}]

Prog

(PARI) SumD(x)={ s=0; while (x>9, s=s+x-10*(x\10); x\=10); s+x }
  for(n=0, 1000, write("b062028.txt", n, " ", n + SumD(n))) \\ Harry J. Smith, Jul 30 2009
(PARI) A062028(n)=n+sumdigits(n) \\ M. F. Hasler, Jul 19 2015
(Haskell) a062028 n = a007953 n + n  -- Reinhard Zumkeller, Oct 11 2013
(Python)
def a(n): return n + sum(map(int, str(n)))
print([a(n) for n in range(71)]) # Michael S. Branicky, Jan 09 2023

Crossrefs

Cf. A007953, A006378, A048521, A107740, A066568, A064806, A176995 (range), A003052, A230093, A248110.

Indices of: A047791 (primes), A107743 (composites), A066564 (squares), A084661 (cubes).

Iterations: A004207 (start=1), A016052 (start=3), A007618 (start=5), A006507 (start=7), A016096 (start=9).

Sequence in context: A095815 A063114 A064806 * A262223 A070196 A345111

Adjacent sequences: A062025 A062026 A062027 * A062029 A062030 A062031

Keyword

nonn,base,easy

Author

Amarnath Murthy, Jun 02 2001

Extensions

More terms from Vladeta Jovovic, Jun 05 2001

Status

approved