|
Search: id:A081973
|
|
|
| A081973 |
|
a(1) = 1; a(n) = a(n-1) + sigma(a(n-1)) where sigma(k) = sum of the divisors of k. |
|
+0
2
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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 (benoit7848c(AT)orange.fr), Apr 17 2003
a(n) == 23 (mod 24) for all n>=5. - Dean Hickerson (dean(AT)math.ucdavis.edu), Apr 20 2003
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..200
|
|
MATHEMATICA
|
a[1]=1; a[n_] := a[n]=a[n-1]+DivisorSigma[1, a[n-1]]
|
|
CROSSREFS
|
Sequence in context: A086219 A055010 A083329 this_sequence A055496 A105120 A084403
Adjacent sequences: A081970 A081971 A081972 this_sequence A081974 A081975 A081976
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 03 2003
|
|
EXTENSIONS
|
More terms from Gabriel Cunningham (gcasey(AT)mit.edu), Apr 07 2003
|
|
|
Search completed in 0.002 seconds
|
