|
%I #61 May 17 2023 20:55:32
%S 0,2,4,6,8,10,12,14,16,18,11,13,15,17,19,21,23,25,27,29,22,24,26,28,
%T 30,32,34,36,38,40,33,35,37,39,41,43,45,47,49,51,44,46,48,50,52,54,56,
%U 58,60,62,55,57,59,61,63,65,67,69,71,73,66,68,70,72,74,76,78,80,82,84,77
%N a(n) = n + sum of the digits of n.
%C a(n) = A248110(n,A007953(n)). - _Reinhard Zumkeller_, Oct 01 2014
%H Harry J. Smith and N. J. A. Sloane, <a href="/A062028/b062028.txt">Table of n, a(n) for n = 0..10000</a> (first 1000 terms were computed by Harry J. Smith)
%H <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>
%F a(n) = n + A007953(n).
%F a(n) = A160939(n+1) - 1. - _Filip Zaludek_, Oct 26 2016
%e a(34) = 34 + 3 + 4 = 41, a(40) = 40 + 4 = 44.
%p with(numtheory): for n from 1 to 100 do a := convert(n,base,10):
%p c := add(a[i],i=1..nops(a)): printf(`%d,`,n+c); od:
%p A062028 := n -> n+add(i,i=convert(n,base,10)) # _M. F. Hasler_, Nov 08 2018
%t Table[n + Total[IntegerDigits[n]], {n, 0, 100}]
%o (PARI) SumD(x)={ s=0; while (x>9, s=s+x-10*(x\10); x\=10); s+x }
%o for(n=0, 1000, write("b062028.txt", n, " ", n + SumD(n))) \\ _Harry J. Smith_, Jul 30 2009
%o (PARI) A062028(n)=n+sumdigits(n) \\ _M. F. Hasler_, Jul 19 2015
%o (Haskell) a062028 n = a007953 n + n -- _Reinhard Zumkeller_, Oct 11 2013
%o (Python)
%o def a(n): return n + sum(map(int, str(n)))
%o print([a(n) for n in range(71)]) # _Michael S. Branicky_, Jan 09 2023
%Y Cf. A007953, A006378, A048521, A107740, A066568, A064806, A176995 (range), A003052, A230093, A248110.
%Y Indices of: A047791 (primes), A107743 (composites), A066564 (squares), A084661 (cubes).
%Y Iterations: A004207 (start=1), A016052 (start=3), A007618 (start=5), A006507 (start=7), A016096 (start=9).
%K nonn,base,easy
%O 0,2
%A _Amarnath Murthy_, Jun 02 2001
%E More terms from _Vladeta Jovovic_, Jun 05 2001
|
