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.
%I A292303 #8 Sep 15 2017 11:43:26
%S A292303 1,1,2,4,4,12,9,33,50,78,99,173,264,658,570,1056,1099,4113,2443,10129,
%T A292303 18866,23226,39775,102665,171529,256039,610467,815809,1795028,3854202,
%U A292303 3044396,10752800,5509162,22665306,25847226,66558954,25219183,167266731,264535960,163511658,346473322,1109093102
%N A292303 a(1) = 1; a(n+1) = Sum_{k=1..n} lcm(a(k),n)/n.
%H A292303 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>
%F A292303 a(1) = 1; a(n+1) = Sum_{k=1..n} a(k)/gcd(a(k),n).
%e A292303 a(1) = 1;
%e A292303 a(2) = lcm(a(1),1)/1 = lcm(1,1)/1 = 1;
%e A292303 a(3) = lcm(a(1),2)/2 + lcm(a(2),2)/2 = lcm(1,2)/2 + lcm(1,2)/2 = 2;
%e A292303 a(4) = lcm(a(1),3)/3 + lcm(a(2),3)/3 + lcm(a(3),3)/3 = lcm(1,3)/3 + lcm(1,3)/3 + lcm(2,3)/3 = 4, etc.
%t A292303 a[1] = 1; a[n_] := a[n] = Sum[LCM[a[k - 1], n - 1]/(n - 1), {k, 2, n}]; Table[a[n], {n, 42}]
%t A292303 a[1] = 1; a[n_] := a[n] = Sum[a[k - 1]/GCD[a[k - 1], n - 1], {k, 2, n}]; Table[a[n], {n, 42}]
%Y A292303 Cf. A056147, A057661, A286946, A287006.
%K A292303 nonn
%O A292303 1,3
%A A292303 _Ilya Gutkovskiy_, Sep 14 2017