login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160664 a(n) = a(n-1) + A000203(n), a(0)=1. 1
1, 2, 5, 9, 16, 22, 34, 42, 57, 70, 88, 100, 128, 142, 166, 190, 221, 239, 278, 298, 340, 372, 408, 432, 492, 523, 565, 605, 661, 691, 763, 795, 858, 906, 960, 1008, 1099, 1137, 1197, 1253, 1343, 1385, 1481 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 0..10000

FORMULA

a(n)=1+A024916(n). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 25 2009]

MATHEMATICA

lst = {1}; a = 1; Do[a = a + DivisorSigma[1, n]; AppendTo[lst, a], {n, 80}]; lst (* Carl Najafi, Aug 21 2011 *)

PROG

(PARI) a(n)=1+sum(k=1, n, sigma(k)) \\ Charles R Greathouse IV, Aug 22 2011

CROSSREFS

Cf. A054519

Sequence in context: A054253 A045649 A024519 * A072829 A169740 A138226

Adjacent sequences:  A160661 A160662 A160663 * A160665 A160666 A160667

KEYWORD

nonn

AUTHOR

Ctibor O. Zizka (c.zizka(AT)email.cz), May 22 2009

EXTENSIONS

More terms from Carl Najafi (carlnajafi(AT)gmail.com), Aug 21 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:03 EST 2012. Contains 205882 sequences.