login
a(n) = a(n-1) + digit sum(n + 2) with a(0) = 2.
1

%I #15 May 24 2024 08:42:13

%S 2,5,9,14,20,27,35,44,45,47,50,54,59,65,72,80,89,99,101,104,108,113,

%T 119,126,134,143,153,164,167,171,176,182,189,197,206,216,227,239,243,

%U 248,254,261,269,278,288,299,311,324,329,335,342,350,359,369,380,392

%N a(n) = a(n-1) + digit sum(n + 2) with a(0) = 2.

%H Paolo Xausa, <a href="/A075543/b075543.txt">Table of n, a(n) for n = 0..10000</a>

%e a(1) = a(0) + digit sum(1 + 2) = 2 + 3 = 5.

%t Block[{k = 2}, NestList[# + DigitSum[++k] &, 2, 100]] (* _Paolo Xausa_, May 24 2024 *)

%o (PARI) c=0; for (n=2,100,c=c+sumdigits(n); print1(c,","))

%Y Cf. A007953, A037123.

%K nonn,base

%O 0,1

%A _Jon Perry_, Oct 11 2002

%E Definition corrected by _Georg Fischer_, May 22 2024