|
|
|
|
|
|
|
|
|
#14 by Georg Fischer at Sun Feb 03 07:02:54 EST 2019
|
|
|
|
|
|
|
|
#13 by Joerg Arndt at Sun Feb 03 06:55:37 EST 2019
|
|
|
|
|
|
|
|
#12 by Jon E. Schoenfield at Sun Feb 03 06:11:40 EST 2019
|
|
|
|
|
|
|
|
#11 by Jon E. Schoenfield at Sun Feb 03 06:11:37 EST 2019
|
|
| NAME
|
a(1)=1; for n> > 1, a(n) = a(n-1) + (the largest value of gcd(a(k),n) for 1<= <= k<= <= n-1).
|
|
| EXAMPLE
|
For those k where 1<= <= k<= <= 9, GCDgcd(a(5),10) = 10 is the largest value for a GCDgcd(a(k),10). So a(10) = a(9) + 10 = 29.
For those k where 1<= <= k<= <= 11, GCDgcd(a(11),12) = 6 is the largest value for a GCDgcd(a(k),12). So a(12) = a(11) + 6 = 36.
|
|
| MAPLE
|
a[1]:=1: for n from 2 to 70 do a[n]:=a[n-1]+max(seq(gcd(a[k], n), k=1..n-1)) od: seq(a[n], n=1..70); - _); # _Emeric Deutsch_, Apr 13 2007
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#10 by Alois P. Heinz at Wed Oct 24 18:16:56 EDT 2018
|
|
|
|
|
|
|
|
#9 by Alois P. Heinz at Wed Oct 24 18:16:48 EDT 2018
|
|
| NAME
|
a(1)=1; for n>1, a(n) = a(n-1) + (the largest value of GCDgcd(a(k),n) for 1<=k<=n-1).
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#8 by Ivan Neretin at Wed Oct 24 17:49:00 EDT 2018
|
|
|
|
|
|
|
|
#7 by Ivan Neretin at Wed Oct 24 17:48:54 EDT 2018
|
|
| LINKS
|
Ivan Neretin, <a href="/A129281/b129281.txt">Table of n, a(n) for n = 1..10000</a>
|
|
| MATHEMATICA
|
Fold[Append[#1, #1[[-1]] + Max@GCD[#1, #2]] &, {1}, Range[2, 56]] (* Ivan Neretin, Oct 24 2018 *)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#6 by Charles R Greathouse IV at Wed Apr 09 10:14:05 EDT 2014
|
|
| AUTHOR
|
_Leroy Quet_ _, Apr 07 2007
|
|
|
|
|
Discussion
|
| Wed Apr 09
| 10:14
| OEIS Server: https://oeis.org/edit/global/2148
|
|
|
|
|
|
|
#5 by N. J. A. Sloane at Wed Feb 05 20:18:34 EST 2014
|
|
| AUTHOR
|
_Leroy Quet _ Apr 07 2007
|
|
|
|
|
Discussion
|
| Wed Feb 05
| 20:18
| OEIS Server: https://oeis.org/edit/global/2118
|
|
|
|
|
|
