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 A025064 #14 Oct 03 2016 16:01:50
%S A025064 8,43,70,105,146,194,248,307,374,448,528,615,707,805,910,1021,1138,
%T A025064 1260,1388,1523,1664,1810,1963,2122,2287,2458,2635,2818,3007,3202,
%U A025064 3403,3610,3823,4042,4267,4498,4735,4978
%N A025064 Position of numbers of form 3*n^2 in A025060 (numbers of form j*k + k*i + i*j, where 1 <=i < j < k).
%F A025064 It is conjectured that A000926 ends at 1848, in which case a(n) = 3*n^2+18*n-38 for all n >= 22. - _Robert Israel_, Sep 06 2016
%p A025064 N:= 10000: # to get positions of all 3*n^2 <= N
%p A025064 B:= sort(convert({seq(seq(seq(i*j + j*k + i*k, i=1..min(j-1, (N-j*k)/(j+k))),j=2..min(k-1,(N-k)/(1+k))),k=3..(N-2)/3)},list)):
%p A025064 count:= 1:
%p A025064 for n from 1 to floor(sqrt(N/3)) do
%p A025064 if member(3*n^2,B,A[count]) then count:= count+1 fi
%p A025064 od:
%p A025064 seq(A[i],i=1..count-1); # _Robert Israel_, Sep 06 2016
%K A025064 nonn
%O A025064 1,1
%A A025064 _Clark Kimberling_
%E A025064 More terms and a(4)-a(7) corrected by _Gionata Neri_, Sep 06 2016