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 A283677 #27 Mar 23 2017 14:40:44
%S A283677 1,1,1,2,2,2,2,6,3,12,12,4,4,4,4,20,5,30,35,35,42,24,24,56,56,56,8,8,
%T A283677 8,8,8,72,9,90,99,36,36,60,130,70,70,154,165,165,60,60,60,195,208,208,
%U A283677 112,112,112,240,240,240,240,16,16,16,16,16,16,272,17,306,323,340,357,357,126,198,414,72,72,456,475,494
%N A283677 a(n) = lcm(b(b(n)), b(n-b(n)+1)) where b(n) = A004001(n).
%C A283677 See the order of certain subsequences in scatterplot link.
%H A283677 Altug Alkan, <a href="/A283677/b283677.txt">Table of n, a(n) for n = 1..10000</a>
%H A283677 Altug Alkan, <a href="/A283677/a283677_2.png">Alternative Scatterplot of A283677</a>
%H A283677 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>
%F A283677 a(n) = lcm(A004001(A004001(n)), A004001(A080677(n))). - _Antti Karttunen_, Mar 18 2017
%e A283677 a(4) = lcm(A004001(A004001(4)), A004001(4-A004001(4)+1)) = lcm(1, 2) = 2.
%t A283677 b[1] = b[2] = 1; b[n_] := b[n] = b[b[n - 1]] + b[n - b[n - 1]]; Table[LCM[b[b[n]], b[n + 1 - b[n]]], {n, 1, 78}] (* _Indranil Ghosh_, Mar 14 2017 *)
%o A283677 (PARI) a=vector(1000); a[1]=a[2]=1; for(n=3, #a, a[n]=a[a[n-1]]+a[n-a[n-1]]); va = vector(1000, n, lcm(a[a[n]], a[n+1-a[n]]))
%o A283677 (Scheme) (define (A283677 n) (lcm (A004001 (A004001 n)) (A004001 (+ 1 (- n (A004001 n)))))) ;; (Code for A004001 given under that entry). - _Antti Karttunen_, Mar 18 2017
%Y A283677 Cf. A004001, A080677.
%Y A283677 Cf. also A283470, A283673.
%K A283677 nonn,look
%O A283677 1,4
%A A283677 _Altug Alkan_, Mar 14 2017