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 A067119 #12 Oct 03 2019 09:51:33 %S A067119 2,8,41,246,16454,1175286,88146471,6855836706,548466936480, %T A067119 44874567530214,3739547294184576,316423232584848746, %U A067119 27121991364415606839,2350572584916019259453,205675101180151685202190 %N A067119 a(n) = floor[X/Y] where X = concatenation of first n even numbers in increasing order and Y = n-th triangular number. %H A067119 Harvey P. Dale, <a href="/A067119/b067119.txt">Table of n, a(n) for n = 1..352</a> %e A067119 a(4) = floor[2468/(1+2+3+4)] = floor[246.8] = 246. %p A067119 for i from 1 to 33 do n := 2*i:c := n:n := n-2:while(n>0) do g := floor(log(c+1)/log(10)):c := c+10^(g+1)*n:n := n-2:end do:a[i] := floor(2*c/i/(i+1)):end do:q := seq(a[j],j=1..33); %t A067119 Module[{nn=20},Table[Floor[FromDigits[Flatten[IntegerDigits/@Range[2,2n,2]]]/((n(n+1))/2)],{n,nn}]] (* _Harvey P. Dale_, Oct 03 2019 *) %Y A067119 Cf. A067112-A067118. %K A067119 easy,nonn,base %O A067119 1,1 %A A067119 _Amarnath Murthy_, Jan 08 2002 %E A067119 More terms from _Sascha Kurz_, Mar 23 2002 %E A067119 Edited by _Charles R Greathouse IV_, Apr 27 2010