Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123859
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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)). +0
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; listen)
OFFSET

1,2

LINKS

Diana Mecum, Table of n, a(n) for n = 1..1128

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 (stefan.steinerberger(AT)gmail.com), Jun 27 2007

CROSSREFS

Cf. A104074.

Adjacent sequences: A123856 A123857 A123858 this_sequence A123860 A123861 A123862

Sequence in context: A057017 A047162 A032486 this_sequence A048744 A057293 A109662

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Jun 26 2007

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 27 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research