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.

A215631 Triangle read by rows: T(n,k) = n^2 + n*k + k^2, 1 <= k <= n.

This page as a plain text file.
%I A215631 #65 Oct 31 2024 01:17:50
%S A215631 3,7,12,13,19,27,21,28,37,48,31,39,49,61,75,43,52,63,76,91,108,57,67,
%T A215631 79,93,109,127,147,73,84,97,112,129,148,169,192,91,103,117,133,151,
%U A215631 171,193,217,243,111,124,139,156,175,196,219,244,271,300,133,147,163
%N A215631 Triangle read by rows: T(n,k) = n^2 + n*k + k^2, 1 <= k <= n.
%H A215631 Reinhard Zumkeller, <a href="/A215631/b215631.txt">Rows n = 1..120 of triangle, flattened</a>
%F A215631 T(n,k) = 2*A070216(n,k) - A215630(n,k).
%F A215631 G.f. for triangle: (3-2*x+3*x*y+x^2-11*x^2*y+4*x^3*y+x^3*y^2+x^4*y^2)*x*y/((1-x)^3*(1-x*y)^3). - _Robert Israel_, May 10 2015
%F A215631 From _Avi Friedlich_, May 26 2015: (Start)
%F A215631 T(n,k) = A093995(n,k) + A075362(n,k) + A133819(n,k).
%F A215631 T(k+1,k) = A003215(k).
%F A215631 T(k+2,k) = A003215(k)/2 + A003215(k+1)/2.
%F A215631 T(k+3,k) = A003215(k)/3 + A003215(k+1)/3 + A003215(k+2)/3 and so on. (End)
%e A215631 The triangle begins:
%e A215631 row n   T(n,k), 1 <= k <= n
%e A215631    1:     3
%e A215631    2:     7   12
%e A215631    3:    13   19   27
%e A215631    4:    21   28   37   48
%e A215631    5:    31   39   49   61   75
%e A215631    6:    43   52   63   76   91  108
%e A215631    7:    57   67   79   93  109  127  147
%e A215631    8:    73   84   97  112  129  148  169  192
%e A215631    9:    91  103  117  133  151  171  193  217  243
%e A215631   10:   111  124  139  156  175  196  219  244  271  300
%e A215631   11:   133  147  163  181  201  223  247  273  301  331  363
%e A215631   12:   157  172  189  208  229  252  277  304  333  364  397  432
%p A215631 seq(seq(i^2+i*j+j^2, j=1..i),i=1..10); # _Robert Israel_, May 10 2015
%t A215631 Table[n^2 + n*k + k^2, {n, 11}, {k, n}] // Flatten (* _Michael De Vlieger_, May 12 2015 *)
%o A215631 (Haskell)
%o A215631 a215631 n k = a215631_tabl !! (n-1) !! (k-1)
%o A215631 a215631_row n = a215631_tabl !! (n-1)
%o A215631 a215631_tabl = zipWith3 (zipWith3 (\u v w -> u + v + w))
%o A215631                         a093995_tabl a075362_tabl a133819_tabl
%o A215631 -- _Reinhard Zumkeller_, Nov 11 2012
%o A215631 (PARI) for(n=1,15,for(k=1,n,print1(n^2+n*k+k^2,", "))) \\ _Derek Orr_, May 13 2015
%o A215631 (Magma) [[i^2+i*j+j^2: j in [1..i]]: i in [1..10]]; // _Vincenzo Librandi_, Jun 07 2015
%Y A215631 Cf. A215646 (row sums), A002061 (left edge, shifted), A033428 (right edge), A003215.
%K A215631 nonn,tabl,easy
%O A215631 1,1
%A A215631 _Reinhard Zumkeller_, Nov 11 2012