A109613 -id:A109613 - cp's OEIS frontend

A110660 Oblong (promic) numbers repeated.

0, 0, 2, 2, 6, 6, 12, 12, 20, 20, 30, 30, 42, 42, 56, 56, 72, 72, 90, 90, 110, 110, 132, 132, 156, 156, 182, 182, 210, 210, 240, 240, 272, 272, 306, 306, 342, 342, 380, 380, 420, 420, 462, 462, 506, 506, 552, 552, 600, 600, 650, 650, 702, 702, 756, 756, 812, 812

Offset: 0

Reinhard Zumkeller, Aug 05 2005

a(floor(n/2)) = A002378(n).
Sum of the even numbers among the smallest parts in the partitions of 2n into two parts (see example). - Wesley Ivan Hurt, Jul 25 2014
For n > 0, a(n-1) is the sum of the smallest parts of the partitions of 2n into two distinct even parts. - Wesley Ivan Hurt, Dec 06 2017

			a(4) = 6; The partitions of 2*4 = 8 into two parts are: (7,1), (6,2), (5,3), (4,4). The sum of the even numbers from the smallest parts of these partitions gives: 2 + 4 = 6.
a(5) = 6; The partitions of 2*5 = 10 into two parts are: (9,1), (8,2), (7,3), (6,4), (5,5). The sum of the even numbers from the smallest parts of these partitions gives: 2 + 4 = 6.

G. C. Greubel, Table of n, a(n) for n = 0..5000
Eric Weisstein's World of Mathematics, Pronic Number
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A109613.

Partial sums give A006584.

k:=1; f:=func; [0] cat [f(n*m): m in [-1,1], n in [1..30]]; // Bruno Berselli, Nov 14 2012

A110660:=n->floor(n/2)*(floor(n/2)+1): seq(A110660(n), n=0..50); # Wesley Ivan Hurt, Jul 25 2014

Table[Floor[n/2] (Floor[n/2] + 1), {n, 0, 50}] (* Wesley Ivan Hurt, Jul 25 2014 *)
CoefficientList[Series[2*x^2/((1 - x)^3*(1 + x)^2), {x, 0, 50}], x] (* Wesley Ivan Hurt, Jul 25 2014 *)
LinearRecurrence[{1,2,-2,-1,1},{0,0,2,2,6},60] (* Harvey P. Dale, Jan 23 2021 *)

a(n)=n\=2;n*(n+1) \\ Charles R Greathouse IV, Jul 05 2013

a(n) = floor(n/2) * (floor(n/2)+1).
a(n) = A028242(n) * A110654(n).
a(n) = A008805(n-2)*2, with A008805(-2) = A008805(-1) = 0.
From Wesley Ivan Hurt, Jul 25 2014: (Start)
G.f.: 2*x^2/((1-x)^3*(1+x)^2);
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5), for n > 4;
a(n) = (2*n^2 + 2*n - 1 + (2*n + 1)*(-1)^n)/8. (End)
a(n) = Sum_{i=1..n; i even} i. - Olivier Pirson, Nov 05 2017

Typo in description (Name) fixed by Harvey P. Dale, Jul 09 2021

A275281 Number T(n,k) of set partitions of [n] with symmetric block size list of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 3, 2, 1, 0, 1, 0, 7, 0, 1, 0, 1, 10, 19, 13, 3, 1, 0, 1, 0, 56, 0, 22, 0, 1, 0, 1, 35, 160, 171, 86, 34, 4, 1, 0, 1, 0, 463, 0, 470, 0, 50, 0, 1, 0, 1, 126, 1337, 2306, 2066, 1035, 250, 70, 5, 1, 0, 1, 0, 3874, 0, 10299, 0, 2160, 0, 95, 0, 1

Offset: 0

Alois P. Heinz, Jul 21 2016

			T(4,2) = 3: 12|34, 13|24, 14|23.
T(5,3) = 7: 12|3|45, 13|2|45, 1|234|5, 1|235|4, 14|2|35, 1|245|3, 15|2|34.
T(6,4) = 13: 12|3|4|56, 13|2|4|56, 1|23|45|6, 1|23|46|5, 14|2|3|56, 1|24|35|6, 1|24|36|5, 1|25|34|6, 1|26|34|5, 15|2|3|46, 1|25|36|4, 1|26|35|4, 16|2|3|45.
T(7,5) = 22: 12|3|4|5|67, 13|2|4|5|67, 1|23|4|56|7, 1|23|4|57|6, 14|2|3|5|67, 1|24|3|56|7, 1|24|3|57|6, 1|2|345|6|7, 1|2|346|5|7, 1|2|347|5|6, 15|2|3|4|67, 1|25|3|46|7, 1|25|3|47|6, 1|2|356|4|7, 1|2|357|4|6, 1|26|3|45|7, 1|27|3|45|6, 16|2|3|4|57, 1|26|3|47|5, 1|2|367|4|5, 1|27|3|46|5, 17|2|3|4|56.
Triangle T(n,k) begins:
  1;
  0, 1;
  0, 1,   1;
  0, 1,   0,    1;
  0, 1,   3,    2,    1;
  0, 1,   0,    7,    0,    1;
  0, 1,  10,   19,   13,    3,    1;
  0, 1,   0,   56,    0,   22,    0,   1;
  0, 1,  35,  160,  171,   86,   34,   4,  1;
  0, 1,   0,  463,    0,  470,    0,  50,  0, 1;
  0, 1, 126, 1337, 2306, 2066, 1035, 250, 70, 5, 1;
  ...

Alois P. Heinz, Rows n = 0..200, flattened
Wikipedia, Partition of a set

Columns k=0-1,3,5,7,9 give: A000007, A000012 for n>0, A275289, A275290, A275291, A275292.
Bisections of columns k=2,4,6,8,10 give: A001700(n-1) for n>0, A275293, A275294, A275295, A275296.
Row sums give A275282.
T(n,A004525(n)) gives A305197.
T(2n,n) gives A275283.
T(2n+1,A109613(n)) gives A305198.
T(n,n) gives A000012.
T(n+3,n+1) gives A002623.

b:= proc(n, s) option remember; expand(`if`(n>s,
      binomial(n-1, n-s-1)*x, 1)+add(binomial(n-1, j-1)*
      b(n-j, s+j)*binomial(s+j-1, j-1), j=1..(n-s)/2)*x^2)
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..n))(b(n, 0)):
seq(T(n), n=0..12);

b[n_, s_] := b[n, s] = Expand[If[n>s, Binomial[n-1, n-s-1]*x, 1] + Sum[ Binomial[n-1, j-1]*b[n-j, s+j]*Binomial[s+j-1, j-1], {j, 1, (n-s)/2} ]*x^2]; T[n_] := Function[p, Table[Coefficient[p, x, i], {i, 0, n}]][b[n, 0]]; Table[T[n], {n, 0, 12}] // Flatten (* Jean-François Alcover, Feb 03 2017, translated from Maple *)

T(n,k) = 0 if n is odd and k is even.

A052938 Expansion of (1 + 2x - 2x^2)/( (1+x)*(1-x)^2 ).

Original entry on oeis.org

1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 8, 7, 9, 8, 10, 9, 11, 10, 12, 11, 13, 12, 14, 13, 15, 14, 16, 15, 17, 16, 18, 17, 19, 18, 20, 19, 21, 20, 22, 21, 23, 22, 24, 23, 25, 24, 26, 25, 27, 26, 28, 27, 29, 28, 30, 29, 31, 30, 32, 31, 33, 32, 34, 33, 35, 34, 36, 35, 37, 36, 38, 37, 39

Offset: 0

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 929
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A028242 (same sequence with 1,0,2 prefix).

Cf. A035106.

List([0..30], n-> (2*n+7-3*(-1)^n)/4); # G. C. Greubel, Oct 18 2019

a052938 n = a052938_list !! n
a052938_list = 1 : 3 : 2 : zipWith (-) [5..] a052938_list
-- Reinhard Zumkeller, Oct 06 2015

[(2*n+7-3*(-1)^n)/4: n in [0..30]]; // G. C. Greubel, Oct 18 2019

R:=PowerSeriesRing(Integers(), 75); Coefficients(R!( (1 + 2*x - 2*x^2)/( (1+x)*(1-x)^2 ))); // Marius A. Burtea, Oct 18 2019

spec := [S,{S=Prod(Union(Sequence(Z),Z,Z),Sequence(Prod(Z,Z)))},unlabeled ]: seq(combstruct[count ](spec,size=n), n=0..20);
seq((2*n+7-3*(-1)^n)/4, n=0..30); # G. C. Greubel, Oct 18 2019

LinearRecurrence[{1,1,-1},{1,3,2},80] (* Harvey P. Dale, Apr 10 2019 *)

a(n)=([0,1,0; 0,0,1; -1,1,1]^n*[1;3;2])[1,1] \\ Charles R Greathouse IV, Sep 02 2015

[(2*n+7-3*(-1)^n)/4 for n in (0..30)] # G. C. Greubel, Oct 18 2019

G.f.: (1+2*x-2*x^2)/((1+x)*(1-x)^2).
a(n) = -a(n-1) + n + 3, with a(0)=1.
a(n) = (3*(-1)^(n+1) + 2*n + 7)/4.
A112034(n) = 3*2^a(n); a(n) = A109613(n+2) - A084964(n). - Reinhard Zumkeller, Aug 27 2005
a(n) = A035106(n+3) - A035106(n+2). - Reinhard Zumkeller, Oct 06 2015
a(n) = A060762(n+1) - 1. - Filip Zaludek, Nov 19 2016
E.g.f.: ((5+x)*sinh(x) + (2+x)*cosh(x))/2. - G. C. Greubel, Oct 18 2019

More terms from James Sellers, Jun 06 2000

A085046 a(n) = n^2 - (1 + (-1)^n)/2.

Original entry on oeis.org

1, 3, 9, 15, 25, 35, 49, 63, 81, 99, 121, 143, 169, 195, 225, 255, 289, 323, 361, 399, 441, 483, 529, 575, 625, 675, 729, 783, 841, 899, 961, 1023, 1089, 1155, 1225, 1295, 1369, 1443, 1521, 1599, 1681, 1763, 1849, 1935, 2025, 2115, 2209, 2303, 2401, 2499, 2601

Offset: 1

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 20 2003

Sequence pattern looks like this 1*1, 1*3, 3*3, 3*5, 5*5, 5*7, 7*7, 7*9, 9*9, 9*11, 11*11, ... = A109613(n-1)*A109613(n).
a(n+1) is the determinant of the n X n matrix M_(i, i)=3, M_(i, j)=2 if (i+j) is even, M_(i, j)=0 if (i+j) is odd. - Benoit Cloitre, Aug 06 2003
a(n) is also the longest path, in number of cells, between diagonally opposite corners of an n X n matrix if diagonal movement between adjacent cells is not allowed and no cell is used more than once. - Ray G. Opao, Jul 02 2007
(-1)^n*a(n) appears to be the Hankel transform of A141222. - Paul Barry, Jun 14 2008
Take an n X n square grid and add unit squares along each side except for the corners --> do this repeatedly along each side with the same restriction until no squares can be added. 4*a(n) is the total number of unit edges in each figure (see example and cf. A255840, A255876). - Wesley Ivan Hurt, Mar 09 2015

			4*a(n) is the number of unit edges in the pattern below (see comments).
                                                                 _
                                                               _|_|_
                            _              _ _               _|_|_|_|_
                          _|_|_          _|_|_|_           _|_|_|_|_|_|_
              _ _       _|_|_|_|_      _|_|_|_|_|_       _|_|_|_|_|_|_|_|_
    _        |_|_|     |_|_|_|_|_|    |_|_|_|_|_|_|     |_|_|_|_|_|_|_|_|_|
   |_|       |_|_|       |_|_|_|      |_|_|_|_|_|_|       |_|_|_|_|_|_|_|
                           |_|          |_|_|_|_|           |_|_|_|_|_|
                                          |_|_|               |_|_|_|
                                                                |_|
   n=1        n=2          n=3             n=4                  n=5
- _Wesley Ivan Hurt_, Mar 09 2015

Stefano Spezia, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).

Cf. A109613. [Bruno Berselli, Sep 17 2013]

Cf. A008811, A141222, A255840, A255876.

[n^2-(1+(-1)^n)/2 : n in [1..100]]; // Wesley Ivan Hurt, Mar 09 2015

A085046:=n->n^2-(1+(-1)^n)/2: seq(A085046(n), n=1..100); # Wesley Ivan Hurt, Mar 09 2015

Table[n^2-1/2 (1+(-1)^n), {n, 60}] (* Bruno Berselli, Sep 17 2013 *)
LinearRecurrence[{2,0,-2,1},{1,3,9,15},70] (* Harvey P. Dale, Oct 25 2015 *)

a(1) = 1, a(2) = 3, then a(2n) = (a(2n-1)*a(2n+1))^1/2 and a(2n+1) = {a(2n) + a(2n+2)}/2. Even-indexed terms are the geometric mean, and odd-indexed terms are the arithmetic mean, of their neighbors.
a(2n+1) = (2n+1)^2 and a(2n) = 4n^2 - 1.
a(n) = A008811(2n) - 1. - N. J. A. Sloane, Jun 12 2004
From Bruno Berselli, Sep 17 2013: (Start)
G.f.: x*(1 + x + 3*x^2 - x^3)/((1+x)*(1-x)^3).
a(n) = n^2 - (1 + (-1)^n)/2. (End)
a(1)=1, a(2)=3, a(3)=9, a(4)=15, a(n) = 2*a(n-1) + 0*a(n-2) -  2*a(n-3) + a(n-4). - Harvey P. Dale, Oct 25 2015
E.g.f.: 1 - cosh(x) + x*(1 + x)*(cosh(x) + sinh(x)). - Stefano Spezia, May 26 2021
Sum_{n>=1} 1/a(n) = Pi^2/8 + 1/2. - Amiram Eldar, Aug 25 2022

More terms from Benoit Cloitre, Aug 06 2003
Formula added in the first comment by Bruno Berselli, Sep 17 2013
Replaced name with Sep 17 2013 formula from Bruno Berselli [Wesley Ivan Hurt, May 17 2020]

A167875 One third of product plus sum of three consecutive nonnegative integers; a(n)=(n+1)(n^2+2n+3)/3.

Original entry on oeis.org

1, 4, 11, 24, 45, 76, 119, 176, 249, 340, 451, 584, 741, 924, 1135, 1376, 1649, 1956, 2299, 2680, 3101, 3564, 4071, 4624, 5225, 5876, 6579, 7336, 8149, 9020, 9951, 10944, 12001, 13124, 14315, 15576, 16909, 18316, 19799, 21360, 23001, 24724, 26531

Offset: 0

Klaus Brockhaus, Nov 14 2009

a(n) = ((n*(n+1)*(n+2))+(n+(n+1)+(n+2)))/3, n >= 0.
Equals A006527 without initial term 0: a(n) = A006527(n+1).
Binomial transform of A167876.
Inverse binomial transform of A080930.
a(n) = A007290(n+2)+n+1.
a(n) = A014820(n)/(n+1) for n > 0.
a(n) = A116731(n+2)-1.
a(n) = A033547(n+1)-n.
a(n) = A054602(n)/3.
a(n) = A086514(n+3)-2.
a(n) = A002061(n+1)+a(n-1) for n > 0.
a(n) = A005894(n)-a(n-1) for n > 0.
First bisection is A057813.
Second differences are in A004277.
a(n) = A177342(n)*(-1)+a(n-1)*5 with n>0. For n=8, a(8)=-A177342(8)+a(7)*5=-631+176*5=249. - Bruno Berselli, May 18 2010

			a(0) = (0*1*2+0+1+2)/3 = (0+3)/3 = 1.
a(1) = (1*2*3+1+2+3)/3 = (6+6)/3 = 4.
a(6)-4*a(5)+6*a(4)-4*a(3)+a(2) = 119-4*76+6*45-4*24+11 = 0. - _Bruno Berselli_, May 26 2010

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A001477 (nonnegative integers),
A006527 ((n^3+2*n)/3),
A167876 (1, 3, 4, 2, 0, 0, 0, 0, ...),
A080930,
A007290 (2*C(n, 3)),
A014820 ((1/3)*(n^2+2*n+3)*(n+1)^2),
A116731,
A033547 (n*(n^2+5)/3),
A054602 (Sum_{d|3} phi(d)*n^(3/d)),
A086514 ((n^3-6*n^2+14*n-6)/3),
A002061 (n^2-n+1),
A005894 (centered tetrahedral numbers),
A057813 ((2*n+1)*(4*n^2+4*n+3)/3),
A004277 (1 and the positive even numbers),
A028387 (n+(n+1)^2),
A166941, A166942, A166943.

[ (&*s + &+s)/3 where s is [n..n+2]: n in [0..42] ];

Select[Table[(n*(n+1)*(n+2)+n+(n+1)+(n+2))/3,{n,0,5!}],IntegerQ[#]&] (* Vladimir Joseph Stephan Orlovsky, Dec 04 2010 *)
(Times@@#+Total[#])/3&/@Partition[Range[0,65],3,1]  (* Harvey P. Dale, Mar 14 2011 *)

a(n)=(n+1)*(n^2+2*n+3)/3 \\ Charles R Greathouse IV, Oct 07 2015

a(n) = (n^3+3*n^2+5*n+3)/3.
a(n) = 3*a(n-1)-3*a(n-2)+a(n-3)+2 for n > 3; a(0)=1, a(1)=4, a(2)=11, a(3)=24.
G.f.: (1+x^2)/(1-x)^4.
a(n) = SUM(A109613(k)*A005408(n-k): 0<=k<=n). - Reinhard Zumkeller, Dec 05 2009
a(n)-4*a(n-1)+6*a(n-2)-4*a(n-3)+a(n-4)=0 for n>3. - Bruno Berselli, May 26 2010

A379624 Triangle read by rows: T(n,k) is the number of free polyominoes with n cells and length k, n >= 1, k = 1..n.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 3, 1, 0, 0, 8, 3, 1, 0, 0, 8, 21, 5, 1, 0, 0, 7, 59, 36, 5, 1, 0, 0, 3, 137, 167, 54, 7, 1, 0, 0, 1, 223, 669, 307, 77, 7, 1, 0, 0, 0, 287, 2089, 1627, 539, 103, 9, 1, 0, 0, 0, 255, 5472, 7126, 3237, 839, 134, 9, 1, 0, 0, 0, 169, 11919, 27504, 16706, 5851, 1271, 168, 11, 1

Offset: 1

Omar E. Pol, Jan 07 2025

The length here is the longer of the two dimensions.

			Triangle begins:
  1;
  0,  1;
  0,  1,  1;
  0,  1,  3,    1;
  0,  0,  8,    3,     1;
  0,  0,  8,   21,     5,     1;
  0,  0,  7,   59,    36,     5,     1;
  0,  0,  3,  137,   167,    54,     7,    1;
  0,  0,  1,  223,   669,   307,    77,    7,    1;
  0,  0,  0,  287,  2089,  1627,   539,  103,    9,   1;
  0,  0,  0,  255,  5472,  7126,  3237,  839,  134,   9,   1;
  0,  0,  0,  169, 11919, 27504, 16706, 5851, 1271, 168,  11,  1;
  ...
Illustration for n = 5:
The free polyominoes with five cells are also called free pentominoes.
For k = 1 there are no free pentominoes of length 1, so T(5,1) = 0.
For k = 2 there are no free pentominoes of length 2, so T(5,2) = 0.
For k = 3 there are eight free pentominoes of length 3 as shown below, so T(5,3) = 8.
   _ _     _ _       _ _     _ _ _     _         _           _       _ _
  |_|_|   |_|_|    _|_|_|   |_|_|_|   |_|       |_|_       _|_|_    |_|_|
  |_|_|   |_|_    |_|_|       |_|     |_|_ _    |_|_|_    |_|_|_|     |_|_
  |_|     |_|_|     |_|       |_|     |_|_|_|     |_|_|     |_|       |_|_|
.
For k = 4 there are three free pentominoes of length 4 as shown below, so T(5,4) = 3.
   _         _       _
  |_|      _|_|    _|_|
  |_|     |_|_|   |_|_|
  |_|_    |_|       |_|
  |_|_|   |_|       |_|
.
For k = 5 there is only one free pentomino of length 5 as shown below, so T(5,5) = 1.
   _
  |_|
  |_|
  |_|
  |_|
  |_|
.
Therefore the 5th row of the triangle is [0, 0, 8, 3, 1] and the row sum is A000105(5) = 12.
.

John Mason, Table of n, a(n) for n = 1..171 (first 18 rows)
Index entries for sequences related to polyominoes.

Row sums give A000105(n).
Column 1 gives A000007.
Leading diagonal gives A000012.
For free polyominoes of width k see A379623.
Cf. A109613, A379627, A379628.

Terms a(37) and beyond from Jinyuan Wang, Jan 08 2025

A379625 Triangle read by rows: T(n,k) is the number of free polyominoes with n cells whose difference between length and width is k, n >= 1, k >= 0.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 1, 3, 0, 1, 6, 2, 3, 0, 1, 7, 16, 6, 5, 0, 1, 25, 39, 27, 11, 5, 0, 1, 80, 120, 97, 45, 19, 7, 0, 1, 255, 425, 307, 191, 71, 28, 7, 0, 1, 795, 1565, 1077, 706, 347, 115, 40, 9, 0, 1, 2919, 5217, 4170, 2505, 1454, 574, 171, 53, 9, 0, 1, 10378, 18511, 15164, 10069, 5481, 2740, 919, 257, 69, 11, 0, 1

Offset: 1

Omar E. Pol, Jan 12 2025

Here the length is the longer of the two dimensions and the width is the shorter of the two dimensions.

			Triangle begins:
      1;
      0,     1;
      1,     0,     1;
      1,     3,     0,     1;
      6,     2,     3,     0,    1;
      7,    16,     6,     5,    0,    1;
     25,    39,    27,    11,    5,    0,   1;
     80,   120,    97,    45,   19,    7,   0,   1;
    255,   425,   307,   191,   71,   28,   7,   0,  1;
    795,  1565,  1077,   706,  347,  115,  40,   9,  0,  1;
   2919,  5217,  4170,  2505, 1454,  574, 171,  53,  9,  0,  1;
  10378, 18511, 15164, 10069, 5481, 2740, 919, 257, 69, 11,  0,  1;
  ...
Illustration for n = 5:
The free polyominoes with five cells are also called free pentominoes.
For k = 0 there are six free pentominoes with length 3 and width 3 as shown below, thus the difference between length and width is 3 - 3 = 0, so T(5,0) = 6.
     _ _     _ _ _     _         _           _       _ _
   _|_|_|   |_|_|_|   |_|       |_|_       _|_|_    |_|_|
  |_|_|       |_|     |_|_ _    |_|_|_    |_|_|_|     |_|_
    |_|       |_|     |_|_|_|     |_|_|     |_|       |_|_|
.
For k = 1 there are two free pentominoes with length 3 and width 2 as shown below, thus the difference between length and width is 3 - 2 = 1, so T(5,1) = 2.
   _ _       _ _
  |_|_|     |_|_|
  |_|_|     |_|_
  |_|       |_|_|
.
For k = 2 there are three free pentominoes with length 4 and width 2 as shown below, thus the difference between length and width is 4 - 2 = 2, so T(5,2) = 3.
   _           _        _
  |_|        _|_|     _|_|
  |_|       |_|_|    |_|_|
  |_|_      |_|        |_|
  |_|_|     |_|        |_|
.
For k = 3 there are no free pentominoes whose difference between length and width is 3, so T(5,3) = 0.
For k = 4 there is only one free pentomino with length 5 and width 1 as shown below, thus the difference between length and width is 5 - 1 = 4, so T(5,4) = 1.
   _
  |_|
  |_|
  |_|
  |_|
  |_|
.
Therefore the 5th row of the triangle is [6, 2, 3, 0, 1] and the row sum is A000105(5) = 12.
Note that for n = 6 and k = 1 there are 15 free polyominoes with length 4 and width 3 thus the difference between length and width is 4 - 3 = 1. Also there is a free polyomino with length 3 and width 2 thus the difference between length and width is 3 - 2 = 1, so T(6,1) = 15 + 1 = 16.
.

John Mason, Table of n, a(n) for n = 1..171 (first 18 rows)
Index entries for sequences related to polyominoes.

Row sums give A000105.
Column 1 gives A259088.
Row sums except the column 1 give A259087.
Leading diagonal gives A000012.
Second diagonal gives A000004.
Cf. A109613, A379623, A379624, A379626, A379627, A379628, A379629, A379637, A379638, A380283, A380284.

Terms a(29) and beyond from Jinyuan Wang, Jan 13 2025

A026646 a(n) = Sum_{i=0..n} Sum_{j=0..n} A026637(i,j).

Original entry on oeis.org

1, 3, 7, 17, 37, 79, 163, 333, 673, 1355, 2719, 5449, 10909, 21831, 43675, 87365, 174745, 349507, 699031, 1398081, 2796181, 5592383, 11184787, 22369597, 44739217, 89478459, 178956943, 357913913, 715827853, 1431655735

Offset: 0

Clark Kimberling

nonn

a(n) indexes the corner blocks on the Jacobsthal spiral built from blocks of unit area (using J(1) and J(2) as the sides of the first block). - Paul Barry, Mar 06 2008

Partial sums of A026644, which are the row sums of A026637. - Paul Barry, Mar 06 2008

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,-1,-3,2).

Cf. A000126, A001045, A026637, A026644, A084639, A109613.
Cf. A026637, A026638, A026639, A026640, A026641, A026642, A026643.
Cf. A026644, A026966, A026967, A026968, A026969, A026970.

[(2^(n+4) -(6*n+9+(-1)^n))/6: n in [0..40]]; // G. C. Greubel, Jul 01 2024

CoefficientList[Series[(1-x^2+2x^3)/((1-x)(1-2x)(1-x^2)), {x, 0, 29}], x] (* Metin Sariyar, Sep 22 2019 *)
LinearRecurrence[{3,-1,-3,2}, {1,3,7,17}, 41] (* G. C. Greubel, Jul 01 2024 *)

[(2^(n+4) - (-1)^n -9 - 6*n)/6 for n in range(41)] # G. C. Greubel, Jul 01 2024

G.f.: (1 -x^2 +2*x^3)/((1-x)*(1-2*x)*(1-x^2)). - Ralf Stephan, Apr 30 2004
From Paul Barry, Mar 06 2008: (Start)
a(n) = A001045(n+3) - 2*floor((n+2)/2).
a(n) = -n + Sum_{k=0..n} A001045(k+2) = A084639(n+1) - n. (End)
a(n+1) = 2*a(n) + A109613(n), a(0)=1. - Paul Curtz, Sep 22 2019

A211955 Triangle of coefficients of a polynomial sequence related to the Morgan-Voyce polynomials A085478.

Original entry on oeis.org

1, 1, 1, 1, 3, 2, 1, 6, 10, 4, 1, 10, 30, 28, 8, 1, 15, 70, 112, 72, 16, 1, 21, 140, 336, 360, 176, 32, 1, 28, 252, 840, 1320, 1056, 416, 64, 1, 36, 420, 1848, 3960, 4576, 2912, 960, 128, 1, 45, 660, 3696, 10296, 16016, 14560, 7680, 2176, 256

Offset: 0

Peter Bala, Apr 30 2012

Let b(n,x) = Sum_{k = 0..n} binomial(n+k,2*k)*x^k denote the Morgan-Voyce polynomials of A085478. This triangle lists the coefficients (in ascending powers of x) of the related polynomial sequence R(n,x) := (1/2)*b(n,2*x) + 1/2. Several sequences already in the database are of the form (R(n,x))n>=0 for a fixed value of x. These include A101265 (x = 1), A011900 (x = 2), A182432 (x = 3), A054318 (x = 4) as well as signed versions of A133872 (x = -1), A109613(x = -2), A146983 (x = -3) and A084159 (x = -4).

The polynomials R(n,x) factorize in the ring Z[x] as R(n,x) = P(n,x)*P(n+1,x) for n >= 1: explicitly, P(2*n,x) = 1/2*(b(2*n,2*x) + 1)/b(n,2*x) and P(2*n+1,x) = b(n,2*x). The coefficients of P(n,x) occur in several tables in the database, although without the connection to the Morgan-Voyce polynomials being noted - see A211956 for more details. In terms of T(n,x), the Chebyshev polynomials of the first kind, we have P(2*n,x) = T(2*n,u) and P(2*n+1,x) = 1/u * T(2*n+1,u), where u = sqrt((x+2)/2). Hence R(n,x) = 1/u * T(n,u) * T(n+1,u).

			Triangle begins
.n\k.|..0....1....2....3....4....5....6
= = = = = = = = = = = = = = = = = = = =
..0..|..1
..1..|..1....1
..2..|..1....3....2
..3..|..1....6...10....4
..4..|..1...10...30...28....8
..5..|..1...15...70..112...72...16
..6..|..1...21..140..336..360..176...32

Eric Weisstein's World of Mathematics, Morgan-Voyce polynomials

Cf. A011900, A084159, A085478, A101265 (row sums), A109613, A112373, A123519, A133872 (alt row sums), A146983, A182432, A204021, A208513, A211956, A211957.

T(n,0) = 1; T(n,k) = 2^(k-1)*binomial(n+k,2*k) for k > 0.
O.g.f. for column k (except column 0): 2^(k-1)*x^k/(1-x)^(2*k+1).
O.g.f.: (1-t*(x+2)+t^2)/((1-t)*(1-2*t(x+1)+t^2)) = 1 + (1+x)*t + (1+3*x+2*x^2)*t^2 + ....
Removing the first column from the triangle produces the Riordan array (x/(1-x)^3, 2*x/(1-x)^2).
The row polynomials R(n,x) := 1/2*b(n,2*x) + 1/2 = 1 + x*Sum_{k = 1..n} binomial(n+k,2*k)*(2*x)^(k-1).
Recurrence equation: R(n,x) = 2*(1+x)*R(n-1,x) - R(n-2,x) - x with initial conditions R(0,x) = 1, R(1,x) = 1+x.
Another recurrence is R(n,x)*R(n-2,x) = R(n-1,x)*(R(n-1,x) + x).
With P(n,x) as defined in the Comments section we have (x+2)/x - {Sum_{k = 0..2n} 1/R(k,x)}^2 = 2/(x*P(2*n+1,x)^2); (x+2)/x - {Sum_{k = 0..2n+1} 1/R(k,x)}^2 = (x+2)/(x*P(2*n+2,x)^2); consequently Sum_{k >= 0} 1/R(k,x) = sqrt((x+2)/x) for either x > 0 or x <= -2.
Row sums R(n,1) = A101265(n+1); Alt. row sums R(n,-1) = A133872(n+1);
R(n,2) = A011900(n); R(n,-2) = (-1)^n * A109613(n); R(n,3) = A182432;
R(n,-3) = (-1)^n * A146983(n); R(n,4) = A054318(n+1); R(n,-4) = (-1)^n * A084159(n).

A093415 Triangle read by rows: a(n, k) is the denominator of (n + (n-1) + ... + (n-k+1))/(1 + 2 + ... + k), 0 < k <= n.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 3, 2, 1, 1, 1, 1, 5, 1, 1, 3, 2, 5, 3, 1, 1, 3, 1, 5, 3, 7, 1, 1, 1, 2, 5, 1, 7, 4, 1, 1, 3, 1, 1, 3, 7, 2, 9, 1, 1, 3, 2, 5, 3, 7, 4, 9, 5, 1, 1, 1, 1, 5, 1, 7, 1, 3, 5, 11, 1, 1, 3, 2, 5, 3, 7, 4, 9, 5, 11, 6, 1, 1, 3, 1, 5, 3, 1, 2, 9, 5, 11, 3, 13, 1, 1, 1, 2, 1, 1, 7, 4, 3, 1, 11, 2

Offset: 1

Amarnath Murthy, Mar 30 2004

A093412 gives the corresponding numerators.

A109613(n+1) - 2 = 2*floor((n+1)/2) - 1 is the largest number in row n. [Corrected by Petros Hadjicostas, Oct 20 2019]

			Triangle a(n,k) (with rows n >= 1 and columns k >= 1) begins as follows:
  1;
  1, 1;
  1, 3, 1;
  1, 3, 2, 1;
  1, 1, 1, 5, 1;
  1, 3, 2, 5, 3, 1;
  1, 3, 1, 5, 3, 7, 1;
  1, 1, 2, 5, 1, 7, 4, 1;
  1, 3, 1, 1, 3, 7, 2, 9, 1;
... - _Petros Hadjicostas_, Oct 20 2019

Cf. A109613, A093412, A093413, A093414, A093417.

a(n, k) = (k+1)/gcd(2n+2, k+1).

Edited and extended by David Wasserman, Feb 01 2006

cp's OEIS Frontend

A110660 Oblong (promic) numbers repeated.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A275281 Number T(n,k) of set partitions of [n] with symmetric block size list of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A052938 Expansion of (1 + 2*x - 2*x^2)/( (1+x)*(1-x)^2 ).

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Haskell

Magma

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A085046 a(n) = n^2 - (1 + (-1)^n)/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

Extensions

A167875 One third of product plus sum of three consecutive nonnegative integers; a(n)=(n+1)(n^2+2n+3)/3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A379624 Triangle read by rows: T(n,k) is the number of free polyominoes with n cells and length k, n >= 1, k = 1..n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A052938 Expansion of (1 + 2x - 2x^2)/( (1+x)*(1-x)^2 ).