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!)
A071122 a(n) = a(n-1) + sum of decimal digits of 2^n. 0

%I #5 Oct 15 2013 22:31:20

%S 2,6,14,21,26,36,47,60,68,75,89,108,128,150,176,201,215,234,263,294,

%T 320,345,386,423,452,492,527,570,611,648,695,753,815,876,935,999,1055,

%U 1122,1193,1254,1304,1350,1406,1464,1526,1596,1664,1737,1802,1878,1958

%N a(n) = a(n-1) + sum of decimal digits of 2^n.

%t s=0; Do[s=s+Apply[Plus, IntegerDigits[2^n]]; Print[s], {n, 1, 128}]

%Y Cf. A037123, A000788, A051351, A071317, A071121.

%K base,easy,nonn

%O 1,1

%A _Labos Elemer_, May 27 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 25 09:32 EDT 2024. Contains 371967 sequences. (Running on oeis4.)