cp's OEIS Frontend

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.

A134482 Triangle read by rows: row n consists of n followed by the numbers n through 2n-2.

This page as a plain text file.
%I A134482 #9 Jun 18 2013 12:16:14
%S A134482 1,2,2,3,3,4,4,4,5,6,5,5,6,7,8,6,6,7,8,9,10,7,7,8,9,10,11,12,8,8,9,10,
%T A134482 11,12,13,14,9,9,10,11,12,13,14,15,16,10,10,11,12,13,14,15,16,17,18,
%U A134482 11,11,12,13,14,15,16,17,18,19,20,12,12,13,14,15,16
%N A134482 Triangle read by rows: row n consists of n followed by the numbers n through 2n-2.
%C A134482 Row sums = A005448.
%F A134482 T(n,1)=n, T(n,k)=n+k-2 for 2<=k<=n. G.f.=z(1-2tz+2zt^2-t^3*z^3)/[(1-z)(1-tz)]^2. - _Emeric Deutsch_, Nov 24 2007
%e A134482 First few rows of the triangle are:
%e A134482 1;
%e A134482 2, 2;
%e A134482 3, 3, 4;
%e A134482 4, 4, 5, 6;
%e A134482 5, 5, 6, 7, 8;
%e A134482 6, 6, 7, 8, 9, 10;
%e A134482 7, 7, 8, 9, 10, 11, 12;
%e A134482 ...
%p A134482 T:=proc(n,k) if n<k then 0 elif k=1 then n else n+k-2 end if end proc: for n to 10 do seq(T(n,k),k=1..n) end do; # yields sequence in triangular form - _Emeric Deutsch_, Nov 24 2007
%t A134482 Flatten[Table[Join[{n},Range[n,2n-2]],{n,12}]] (* _Harvey P. Dale_, Jun 18 2013 *)
%Y A134482 Cf. A005448.
%K A134482 nonn,tabl
%O A134482 1,2
%A A134482 _Gary W. Adamson_, Oct 27 2007
%E A134482 Corrected and extended by _Harvey P. Dale_, Jun 18 2013