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!)
A123859 a(1)=1. a(n) = a(n-1) + (sum of the terms, from among terms a(1) through a(n-1), which divide sum{k=1 to n-1} a(k)). 1
1, 2, 3, 9, 13, 16, 19, 32, 52, 56, 57, 125, 126, 127, 130, 184, 243, 244, 245, 248, 254, 257, 258, 259, 278, 281, 294, 298, 299, 979, 980, 984, 1073, 1076, 1079, 1083, 1357, 1358, 1362, 1375, 1378, 1381, 1510, 1524, 1525, 1547, 1548, 1549, 1552, 1558, 1626 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
The sum of the first 7 terms of the sequence is 63. The terms, from among the first 7 terms, which divide 63 are 1,3,9. So a(8) = a(7) + 1 + 3 + 9 = 32.
MATHEMATICA
a = {1}; For[n = 2, n < 60, n++, su = Plus @@ a; co = 0; For[i = 1, i < n, i++, If[IntegerQ[su/a[[i]]], co = co + a[[i]]]]; AppendTo[a, a[[ -1]] + co]]; a (* Stefan Steinerberger, Jun 27 2007 *)
CROSSREFS
Cf. A104074.
Sequence in context: A155929 A175206 A032486 * A048744 A101234 A233190
KEYWORD
nonn
AUTHOR
Leroy Quet, Jun 26 2007
EXTENSIONS
More terms from Stefan Steinerberger, Jun 27 2007
STATUS
approved

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 23 16:28 EDT 2024. Contains 371916 sequences. (Running on oeis4.)