cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A081973 a(1) = 1; a(n) = a(n-1) + sigma(a(n-1)) where sigma(k) = sum of the divisors of k.

Original entry on oeis.org

1, 2, 5, 11, 23, 47, 95, 215, 479, 959, 2063, 4127, 8255, 19007, 38327, 76655, 168647, 338663, 708263, 1453823, 3308543, 7154303, 14919599, 29910119, 59820239, 119676959, 239387375, 538142975, 1205440295, 2651968655, 6663140495
Offset: 1

Views

Author

Amarnath Murthy, Apr 03 2003

Keywords

Comments

a(n+1)/a(n) >= 2 for all n. Is a(n+1)/a(n) bounded? Up to n=160, the maximum value is a(31)/a(30)=2.5125261124174184479... - Benoit Cloitre, Apr 17 2003
a(n) == 23 (mod 24) for all n>=5. - Dean Hickerson, Apr 20 2003
a(n) = partial sums of A165929(n). [From Jaroslav Krizek, Sep 30 2009]

Programs

  • Mathematica
    a[1]=1; a[n_] := a[n]=a[n-1]+DivisorSigma[1, a[n-1]]

Extensions

More terms from Gabriel Cunningham (gcasey(AT)mit.edu), Apr 07 2003
Showing 1-1 of 1 results.