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 A139040 #20 Apr 26 2017 22:58:05 %S A139040 1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,2,2,1,1,1,1,2,3,2,1,1,1,1,2,3,3,2, %T A139040 1,1,1,1,2,3,4,3,2,1,1,1,1,2,3,4,4,3,2,1,1,1,1,2,3,4,6,4,3,2,1,1,1,1, %U A139040 2,3,4,6,6,4,3,2,1,1,1,1,2,3,4,6,9,6,4,3,2,1,1,1,1,2,3,4,6,9,9,6,4,3,2,1,1 %N A139040 Triangle read by rows: each row is an initial segment of the terms of A000930 followed by its reflection. %H A139040 G. C. Greubel, <a href="/A139040/b139040.txt">Table of n, a(n) for the first 100 rows, flattened</a> %e A139040 Triangle begins: %e A139040 {1}, %e A139040 {1, 1}, %e A139040 {1, 1, 1}, %e A139040 {1, 1, 1, 1}, %e A139040 {1, 1, 2, 1, 1}, %e A139040 {1, 1, 2, 2, 1, 1}, %e A139040 {1, 1, 2, 3, 2, 1, 1}, %e A139040 {1, 1, 2, 3, 3, 2, 1, 1}, %e A139040 {1, 1, 2, 3, 4, 3, 2, 1, 1}, %e A139040 {1, 1, 2, 3, 4, 4, 3, 2, 1, 1}, %e A139040 {1, 1, 2, 3, 4, 6, 4, 3, 2, 1, 1} %p A139040 A000930 := proc(n) coeftayl( 1/(1-x-x^3),x=0,n) ; end: A139040 := proc(n,m) A000930(min(m,n+1-m)) ; end: for n from 1 to 16 do for m from 1 to n do printf("%d,",A139040(n,m)) ; od: od: # _R. J. Mathar_, Jun 08 2008 %t A139040 a[-2]=0;a[-1]=1;a[0]=1;a[n_]:=a[n]=a[n-1]+a[n-3];(*A000930*) %t A139040 g[n_,m_]:=If[m <= Floor[n/2],a[m],a[n-m]];w=Table[Table[g[n,m],{m,0,n}],{n,0,10}]; Flatten[w] %Y A139040 Cf. A139147, A000930. Row sums are in A238383. %K A139040 nonn,easy,tabl %O A139040 1,13 %A A139040 _Roger L. Bagula_ and _Gary W. Adamson_, May 31 2008 %E A139040 Edited and corrected by _N. J. A. Sloane_, Jun 30 2008 %E A139040 Corrected by _Philippe Deléham_, Feb 25 2014