A093328 -id:A093328 - cp's OEIS frontend

A103415 Triangle, read by rows, T(n,k) = A000129(n+1) - Sum_{j=1..k} t(n+1, j), where t(n, k) is defined in the formula section.

1, 2, 1, 5, 4, 1, 12, 11, 6, 1, 29, 28, 21, 8, 1, 70, 69, 60, 35, 10, 1, 169, 168, 157, 116, 53, 12, 1, 408, 407, 394, 333, 204, 75, 14, 1, 985, 984, 969, 884, 653, 332, 101, 16, 1, 2378, 2377, 2360, 2247, 1870, 1189, 508, 131, 18, 1, 5741, 5740, 5721, 5576, 5001, 3712, 2029, 740, 165, 20, 1

Offset: 0

Lambert Klasen (lambert.klasen(AT)gmx.net) and Gary W. Adamson, Feb 04 2005

Triangle is generated from the product A*B of the infinite lower triangular matrices A = A008288(n,k) and B =
  1;
  1 1;
  1 1 1;
  1 1 1 1; ...
Determinant(A*B) = 1 for all n.
Absolute values of coefficients of characteristic polynomials of n-th matrix are the (n+1)-th row of A007318 (Pascal's triangle). As they are:
  x^1 - 1;
  x^2 - 2*x^1 +  1;
  x^3 - 3*x^2 +  3*x^1 -  1;
  x^4 - 4*x^3 +  6*x^2 -  4*x^1 + 1;
  x^5 - 5*x^4 + 10*x^3 - 10*x^2 + 5*x^1 - 1.

			Triangle begins as:
    1;
    2,   1;
    5,   4,   1;
   12,  11,   6,   1;
   29,  28,  21,   8,   1;
   70,  69,  60,  35,  10,  1;
  169, 168, 157, 116,  53, 12,  1;
  408, 407, 394, 333, 204, 75, 14, 1;

G. C. Greubel, Rows n = 0..50 of the triangle, flattened

Cf. A000129, A002203, A005409, A007318, A008288, A026937, A093328, A103416.

t[n_, k_]:= If[k==0, (2*Boole[n<2] + LucasL[n-1, 2]*Boole[n>1])/2, Binomial[n-1, k-1]*Hypergeometric2F1[1-k, k-n, 1-n, -1]];
st[n_, k_]:= Sum[t[n+1, j], {j,k}];
T[n_, k_]:= Fibonacci[n+1, 2] - st[n, k];
Table[T[n, k], {n, 0, 12}, {k, 0, n}]//Flatten (* G. C. Greubel, May 25 2021 *)

Pell(n) = if( n<2, n, 2*Pell(n-1) + Pell(n-2) );
t(n, k) = if(n<3, 1, if(k==1||k==n, 1, t(n-1,k) + t(n-1,k-1) + t(n-2,k-1) ));
st(n, k) = sum(i=1, k, t(n+1,i));
T(n, k) = Pell(n+1) - st(n,k);
for(n=0, 10, for(k=0, n, print1(T(n,k), ",")); print()) \\ modified by G. C. Greubel, May 25 2021

@CachedFunction
def t(n,k): return 1 if (n<3) else 1 if (k==1 or k==n) else t(n-1,k) + t(n-1,k-1) + t(n-2,k-1)
def st(n,k): return sum(t(n+1, j) for j in (1..k))
def T(n,k): return lucas_number1(n+1,2,-1) - st(n,k)
flatten([[T(n,k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, May 25 2021

T(n, k) = Pell(n+1) - ST(n, k), where ST(n, k) = Sum_{j=1..k} t(n+1, j), t(n, k) = t(n-1,k) + t(n-1,k-1) + t(n-2,k-1), t(n, 1) = t(n, n) = 1 and t(0, k) = t(1, k) = t(2, k) = 1.
T(n, 0) = A000129(n+1).
T(n, 1) = A005409(n) = A000129(n) - 1.
Sum_{k=0..n} T(n, k) = A026937(n).
From G. C. Greubel, May 25 2021: (Start)
T(n, k) = A000129(n+1) - st(n,k), where st(n, k) = Sum_{j=1..k} t(n+1, j), t(n, k) = A008288(n-1, k-1) for n >= 1 and k >= 1, and t(n, 0) = (1/2)*(2*[n<2] + A002203(n-1)*[n>1]).
T(n, n) = A000012(n).
T(n, n-1) = A005843(n+1).
T(n, n-2) = A093328(n-1).
T(n, n-3) = (4/3)*((n-3)^3 + 5*(n-3) + 3).
T(n, n-4) = (1/3)*(2*(n-4)^2 + 22*(n-4)^2 + 22*(n-4) + 39). (End)

A199855 Inverse permutation to A210521.

Original entry on oeis.org

1, 4, 2, 5, 3, 6, 11, 7, 12, 8, 13, 9, 14, 10, 15, 22, 16, 23, 17, 24, 18, 25, 19, 26, 20, 27, 21, 28, 37, 29, 38, 30, 39, 31, 40, 32, 41, 33, 42, 34, 43, 35, 44, 36, 45, 56, 46, 57, 47, 58, 48, 59, 49, 60, 50, 61, 51, 62, 52, 63, 53, 64, 54, 65, 55, 66, 79

Offset: 1

Boris Putievskiy, Feb 04 2013

Permutation of the natural numbers.
a(n) is a pairing function: a function that reversibly maps Z^{+} x Z^{+} onto Z^{+}, where Z^{+} is the set of integer positive numbers.
Enumeration table T(n,k). The order of the list:
  T(1,1)=1;
  T(2,1), T(2,2), T(1,2), T(1,3), T(3,1),
  ...
  T(2,n-1), T(4,n-3), T(6,n-5), ..., T(n,1),
  T(2,n),   T(4,n-2), T(6,n-4), ..., T(n,2),
  T(1,n),   T(3,n-2), T(5,n-4), ..., T(n-1,2),
  T(1,n+1), T(3,n-1), T(5,n-3), ..., T(n+1,1),
  ...
The order of the list elements of adjacent antidiagonals. Let m be a positive integer.
Movement by antidiagonal {T(1,2*m), T(2*m,1)}     from T(2,2*m-1) to T(2*m,1)   length of step is 2,
movement by antidiagonal {T(1,2*m+1), T(2*m+1,1)} from T(2,2*m)   to T(2*m,2)   length of step is 2,
movement by antidiagonal {T(1,2*m), T(2*m,1)}     from T(1,2*m)   to T(2*m-1,2) length of step is 2,
movement by antidiagonal {T(1,2*m+1), T(2*m+1,1)} from T(1,2*m+1) to T(2*m+1,1) length of step is 2.
Table contains:
  row  1 is alternation of elements A001844 and A084849,
  row  2 is alternation of elements A130883 and A058331,
  row  3 is alternation of elements A051890 and A096376,
  row  4 is alternation of elements A033816 and A005893,
  row  6 is alternation of elements A100037 and A093328;
  row  5  accommodates elements A097080 in odd places,
  row  7  accommodates elements A137882 in odd places,
  row 10  accommodates elements A100038 in odd places,
  row 14  accommodates elements A100039 in odd places;
  column 1 is A093005 and alternation of elements A000384 and A001105,
  column 2 is alternation of elements A046092 and A014105,
  column 3 is A105638 and alternation of elements A014106 and A056220,
  column 4 is alternation of elements A142463 and A014107,
  column 5 is alternation of elements A091823 and A054000,
  column 6 is alternation of elements A090288 and |A168244|,
  column 8 is alternation of elements A059993 and A033537;
  column  7 accommodates elements  A071355  in odd  places,
  column  9 accommodates elements |A147973| in even places,
  column 10 accommodates elements  A139570  in odd  places,
  column 13 accommodates elements  A130861  in odd  places.

			The start of the sequence as table:
   1,  4,  5,  11,  13,  22,  25,  37,  41,  56,  61, ...
   2,  3,  7,   9,  16,  19,  29,  33,  46,  51,  67, ...
   6, 12, 14,  23,  26,  38,  42,  57,  62,  80,  86, ...
   8, 10, 17,  20,  30,  34,  47,  52,  68,  74,  93, ...
  15, 24, 27,  39,  43,  58,  63,  81,  87, 108, 115, ...
  18, 21, 31,  35,  48,  53,  69,  75,  94, 101. 123, ...
  28, 40, 44,  59,  64,  82,  88, 109, 116, 140, 148, ...
  32, 36, 49,  54,  70,  76,  95, 102, 124, 132, 157, ...
  45, 60, 65,  83,  89, 110, 117, 141, 149, 176, 185, ...
  50, 55, 71,  77,  96, 103, 125, 133, 158, 167, 195, ...
  66, 84, 90, 111, 118, 142, 150, 177, 186, 216, 226, ...
  ...
The start of the sequence as triangle array read by rows:
   1;
   4,  2;
   5,  3,  6;
  11,  7, 12,  8;
  13,  9, 14, 10, 15;
  22, 16, 23, 17, 24, 18;
  25, 19, 26, 20, 27, 21, 28;
  37, 29, 38, 30, 39, 31, 40, 32;
  41, 33, 42, 34, 43, 35, 44, 36, 45;
  56, 46, 57, 47, 58, 48, 59, 49, 60, 50;
  61, 51, 62, 52, 63, 53, 64, 54, 65, 55, 66;
  ...
The start of the sequence as array read by rows, the length of row r is 4*r-3.
First 2*r-2 numbers are from the row number 2*r-2 of  triangle array, located above.
Last  2*r-1 numbers are from the row number 2*r-1 of  triangle array, located above.
   1;
   4, 2, 5, 3, 6;
  11, 7,12, 8,13, 9,14,10,15;
  22,16,23,17,24,18,25,19,26,20,27,21,28;
  37,29,38,30,39,31,40,32,41,33,42,34,43,35,44,36,45;
  56,46,57,47,58,48,59,49,60,50,61,51,62,52,63,53,64,54,65,55,66;
  ...
Row number r contains permutation numbers 4*r-3 from 2*r*r-5*r+4 to 2*r*r-r:
2*r*r-3*r+2,2*r*r-5*r+4, 2*r*r-3*r+3, 2*r*r-5*r+5, 2*r*r-3*r+4, 2*r*r-5*r+6, ..., 2*r*r-3*r+1, 2*r*r-r.
...

Boris Putievskiy, Rows n = 1..140 of triangle, flattened
Boris Putievskiy, Transformations [of] Integer Sequences And Pairing Functions arXiv:1212.2732 [math.CO], 2012.
Eric Weisstein's World of Mathematics, Pairing functions
Index entries for sequences that are permutations of the natural numbers

Cf. A210521, A001844, A084849, A130883, A058331, A051890, A096376, A033816, A005893, A100037, A093328, A097080, A137882, A100038, A100039, A093005, A000384, A001105, A046092, A014105, A105638, A014106, A056220, A142463, A014107, A091823, A054000, A090288, A168244, A059993, A033537, A071355, A147973, A139570, A130861.

t=int((math.sqrt(8*n-7) - 1)/ 2)
i=n-t*(t+1)/2
j=(t*t+3*t+4)/2-n
result=(2*j**2+(4*i-5)*j+2*i**2-3*i+2+(2+(-1)**j)*((1-(t+1)*(-1)**i)))/4

T(n,k) = (2*k^2+(4*n-5)*k+2*n^2-3*n+2+(2+(-1)^k)*((1-(k+n-1)*(-1)^i)))/4.

a(n) = (2*j^2+(4*i-5)*j+2*i^2-3*i+2+(2+(-1)^j)*((1-(t+1)*(-1)^i)))/4, where i=n-t*(t+1)/2, j=(t*t+3*t+4)/2-n, t=floor((sqrt(8*n-7) - 1)/2).

A221216 T(n,k) = ((n+k)^2-2(n+k)+4-(3n+k-2)*(-1)^(n+k))/2; n , k > 0, read by antidiagonals.

Original entry on oeis.org

1, 5, 6, 4, 3, 2, 12, 13, 14, 15, 11, 10, 9, 8, 7, 23, 24, 25, 26, 27, 28, 22, 21, 20, 19, 18, 17, 16, 38, 39, 40, 41, 42, 43, 44, 45, 37, 36, 35, 34, 33, 32, 31, 30, 29, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46, 80

Offset: 1

Boris Putievskiy, Feb 22 2013

Permutation of the natural numbers.
a(n) is a pairing function: a function that reversibly maps Z^{+} x Z^{+} onto Z^{+}, where Z^{+} is the set of integer positive numbers.
Enumeration table T(n,k). Let m be natural number. The order of the list:
  T(1,1)=1;
  T(3,1), T(2,2), T(1,3);
  T(1,2), T(2,1);
  . . .
  T(2*m+1,1), T(2*m,2), T(2*m-1,3),...T(2,2*m), T(1,2*m+1);
  T(1,2*m), T(2,2*m-1), T(3,2*m-2),...T(2*m-1,2),T(2*m,1);
  . . .
First row  contains antidiagonal {T(1,2*m+1), ... T(2*m+1,1)}, read upwards.
Second row contains antidiagonal {T(1,2*m), ... T(2*m,1)},  read downwards.

			The start of the sequence as table:
  1....5...4..12..11..23..22...
  6....3..13..10..24..21..39...
  2...14...9..25..20..40..35...
  15...8..26..19..41..34..60...
  7...27..18..42..33..61..52...
  28..17..43..32..62..51..85...
  16..44..31..63..50..86..73...
  . . .
The start of the sequence as triangle array read by rows:
  1;
  5,6;
  4,3,2;
  12,13,14,15;
  11,10,9,8,7;
  23,24,25,26,27,28;
  22,21,20,19,18,17,16;
  . . .
Row number r consecutive contains r numbers.
If r is odd,  row is decreasing.
If r is even, row is increasing.

Boris Putievskiy, Rows n = 1..140 of triangle, flattened
Boris Putievskiy, Transformations [of] Integer Sequences And Pairing Functions arXiv:1212.2732 [math.CO], 2012.
Eric Weisstein's World of Mathematics, Pairing functions
Index entries for sequences that are permutations of the natural numbers

Cf. A211394, A221215, A002260, A004736, A003057;
table T(n,k) contains: in rows A084849, A096376, A014105, A014107, A168244, A033537, A100040, A100041;
in columns A130883, A000384, A014106, A033816, A100037, A091823, A071355, A100038, A100039,A130861;
main diagonal and parallel diagonals are  A058331, A001844, A005893,A046092, A093328, A142463, A090288, A059993, A051890, A001105, A097080, A056220, A137882, A054000.

t=int((math.sqrt(8*n-7) - 1)/ 2)
i=n-t*(t+1)/2
j=(t*t+3*t+4)/2-n
result=((t+2)**2-2*(t+2)+4-(3*i+j-2)*(-1)**t)/2

As table
T(n,k) = ((n+k)^2-2*(n+k)+4-(3*n+k-2)*(-1)^(n+k))/2.
As linear sequence
a(n) = (A003057(n)^2-2*A003057(n)+4-(3*A002260(n)+A004736(n)-2)*(-1)^A003056(n))/2;  a(n) = ((t+2)^2-2*(t+2)+4-(i+3*j-2)*(-1)^t)/2,
  where i=n-t*(t+1)/2, j=(t*t+3*t+4)/2-n, t=floor((-1+sqrt(8*n-7))/2).

A221217 T(n,k) = ((n+k)^2-2n+3-(n+k-1)(1+2*(-1)^(n+k)))/2; n , k > 0, read by antidiagonals.

Original entry on oeis.org

1, 6, 5, 4, 3, 2, 15, 14, 13, 12, 11, 10, 9, 8, 7, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 66, 65, 64, 63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46, 91

Offset: 1

Boris Putievskiy, Feb 22 2013

Permutation of the natural numbers.
a(n) is a pairing function: a function that reversibly maps Z^{+} x Z^{+} onto Z^{+}, where Z^{+} is the set of integer positive numbers.
Enumeration table T(n,k). Let m be natural number. The order of the list:
  T(1,1)=1;
  T(3,1), T(2,2), T(1,3);
  T(2,1), T(1,2);
  . . .
  T(2*m+1,1), T(2*m,2), T(2*m-1,3),...T(1,2*m+1);
  T(2*m,1), T(2*m-1,2), T(2*m-2,3),...T(1,2*m);
  . . .
First row  contains antidiagonal {T(1,2*m+1), ... T(2*m+1,1)}, read upwards.
Second row contains antidiagonal {T(1,2*m), ... T(2*m,1)},  read upwards.

			The start of the sequence as table:
  1....6...4..15..11..28..22...
  5....3..14..10..27..21..44...
  2...13...9..26..20..43..35...
  12...8..25..19..42..34..63...
  7...24..18..41..33..62..52...
  23..17..40..32..61..51..86...
  16..39..31..60..50..85..73...
  . . .
The start of the sequence as triangle array read by rows:
  1;
  6,5;
  4,3,2;
  15,14,13,12;
  11,10,9,8,7;
  28,27,26,25,24,23;
  22,21,20,19,18,17,16;
  . . .
Row number r consecutive contains r numbers in decreasing order.

Boris Putievskiy, Rows n = 1..140 of triangle, flattened
Boris Putievskiy, Transformations [of] Integer Sequences And Pairing Functions arXiv:1212.2732 [math.CO], 2012.
Eric Weisstein's World of Mathematics, Pairing functions
Index entries for sequences that are permutations of the natural numbers

Cf. A211394, A221215, A002260, A004736, A003057, A002024;
table T(n,k) contains: in rows A084849, A000384, A014106, A014105, A014107, A091823, A071355, A091823, A071355,  A100040, A130861, A100041;
in columns A130883, A096376, A033816, A100037, A100038, A100039;
main diagonal and parallel diagonals are A058331, A051890, A005893, A097080, A093328, A137882, A001844, A001105, A056220, A142463, A054000, A090288, A059993.

t=int((math.sqrt(8*n-7) - 1)/ 2)
i=n-t*(t+1)/2
j=(t*t+3*t+4)/2-n
result=((t+2)**2-2*i+3-(t+1)*(1+2*(-1)**t))/2

As table
T(n,k) = ((n+k)^2-2*n+3-(n+k-1)*(1+2*(-1)^(n+k)))/2.
As linear sequence
a(n) = (A003057(n)^2-2*A002260(n)+3-A002024(n)*(1+2*(-1)^A003056(n)))/2;
a(n) = ((t+2)^2-2*i+3-(t+1)*(1+2*(-1)**t))/2, where i=n-t*(t+1)/2,
  j=(t*t+3*t+4)/2-n, t=floor((-1+sqrt(8*n-7))/2).

A322597 a(n) = (4n^3 - 6n^2 + 20*n + 3)/3.

Original entry on oeis.org

1, 7, 17, 39, 81, 151, 257, 407, 609, 871, 1201, 1607, 2097, 2679, 3361, 4151, 5057, 6087, 7249, 8551, 10001, 11607, 13377, 15319, 17441, 19751, 22257, 24967, 27889, 31031, 34401, 38007, 41857, 45959, 50321, 54951, 59857, 65047, 70529, 76311, 82401, 88807

Offset: 0

Franck Maminirina Ramaharo, Jan 23 2019

For n >= 2, a(n) gives the number of function evaluations for Dooren and Ridder's degree 5 and 7 cubature rule over an n-dimensional cube, with the exception of a(3) = 45 and a(4) = 97.

Ronald Cools, Encyclopaedia of Cubature Formulas
Paul van Dooren and Luc de Ridder, An adaptive algorithm for numerical integration over an n-dimensional cube, Journal of Computational and Applied Mathematics, Vol. 2 (1976), 207-217.
Alan C. Genz and Awais A. Malik, Remarks on algorithm 006: An adaptive algorithm for numerical integration over an N-dimensional rectangular region, Journal of Computational and Applied Mathematics, Vol. 6 (1980), 295-302.
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

First differences: 2*A093328.

Cf. A174794, A321124, A322594, A322595.

[(4*n^3-6*n^2+20*n+3)/3$n=0..50]; # Muniru A Asiru, Jan 23 2019

Table[(4*n^3 - 6*n^2 + 20*n + 3)/3, {n, 0, 50}]

makelist((4*n^3 - 6*n^2 + 20*n + 3)/3, n, 0, 50);

a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4), n >= 4.
G.f.: (1 + 3*x - 5*x^2 + 9*x^3)/((1 - x)^4).
E.g.f.: (1/3)*(3 + 18*x + 6*x^2 + 4*x^3)*exp(x).

cp's OEIS Frontend

A103415 Triangle, read by rows, T(n,k) = A000129(n+1) - Sum_{j=1..k} t(n+1, j), where t(n, k) is defined in the formula section.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Sage

Formula

A199855 Inverse permutation to A210521.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

Formula

A221216 T(n,k) = ((n+k)^2-2*(n+k)+4-(3*n+k-2)*(-1)^(n+k))/2; n , k > 0, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

Formula

A221217 T(n,k) = ((n+k)^2-2*n+3-(n+k-1)*(1+2*(-1)^(n+k)))/2; n , k > 0, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

Formula

A322597 a(n) = (4*n^3 - 6*n^2 + 20*n + 3)/3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Maxima

Formula

A221216 T(n,k) = ((n+k)^2-2(n+k)+4-(3n+k-2)*(-1)^(n+k))/2; n , k > 0, read by antidiagonals.

A221217 T(n,k) = ((n+k)^2-2n+3-(n+k-1)(1+2*(-1)^(n+k)))/2; n , k > 0, read by antidiagonals.

A322597 a(n) = (4n^3 - 6n^2 + 20*n + 3)/3.