login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075543 a[n] = a[n-1] + digit sum(n) - 1. 0

%I #3 Mar 31 2012 13:21:54

%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) - 1.

%e 2+3=5

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

%K nonn,base

%O 0,1

%A _Jon Perry_, Oct 11 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)