|
Search: id:A100676
|
|
|
| A100676 |
|
a(1) = 1; a(n+1) = sum{k=1..n} a(GCD(a(k),n)). |
|
+0
1
|
|
| 1, 1, 2, 3, 4, 5, 7, 13, 10, 10, 31, 11, 15, 27, 20, 48, 67, 17, 33, 19, 66, 33, 144, 23, 81, 40, 40, 120, 48, 29, 146, 176, 260, 878, 100, 71, 176, 37, 70, 78, 420, 41, 144, 43, 274, 172, 189, 47, 407, 73, 209, 132, 266, 53, 235, 364, 478, 169, 105, 59, 411, 61, 207, 479
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MAPLE
|
a[1]:=1: for n from 2 to 75 do b[n]:=[seq(a[gcd(a[k], n-1)], k=1..n-1)]: a[n]:=sum(b[n][j], j=1..nops(b[n])) od: seq(a[n], n=1..75);
|
|
MATHEMATICA
|
a[1] = 1; a[n_] := a[n] = Plus @@ a /@ GCD[Table[a[i], {i, n - 1}], n - 1]; Table[ a[n], {n, 64}] (from Robert G. Wilson v Dec 09 2004)
|
|
CROSSREFS
|
Sequence in context: A133428 A090703 A137357 this_sequence A066661 A125707 A039060
Adjacent sequences: A100673 A100674 A100675 this_sequence A100677 A100678 A100679
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Dec 06 2004
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu) and Robert G. Wilson v, Dec 09 2004
|
|
|
Search completed in 0.002 seconds
|
