A132758 -id:A132758 - cp's OEIS frontend

A002260 Triangle read by rows: T(n,k) = k for n >= 1, k = 1..n.

1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14

Offset: 1

Angele Hamel (amh(AT)maths.soton.ac.uk)

Old name: integers 1 to k followed by integers 1 to k+1 etc. (a fractal sequence).
Start counting again and again.
This is a "doubly fractal sequence" - see the Franklin T. Adams-Watters link.
The PARI functions t1, t2 can be used to read a square array T(n,k) (n >= 1, k >= 1) by antidiagonals downwards: n -> T(t1(n), t2(n)). - Michael Somos, Aug 23 2002
Reading this sequence as the antidiagonals of a rectangular array, row n is (n,n,n,...); this is the weight array (Cf. A144112) of the array A127779 (rectangular). - Clark Kimberling, Sep 16 2008
The upper trim of an arbitrary fractal sequence s is s, but the lower trim of s, although a fractal sequence, need not be s itself. However, the lower trim of A002260 is A002260. (The upper trim of s is what remains after the first occurrence of each term is deleted; the lower trim of s is what remains after all 0's are deleted from the sequence s-1.) - Clark Kimberling, Nov 02 2009
Eigensequence of the triangle = A001710 starting (1, 3, 12, 60, 360, ...). - Gary W. Adamson, Aug 02 2010
The triangle sums, see A180662 for their definitions, link this triangle of natural numbers with twenty-three different sequences, see the crossrefs. The mirror image of this triangle is A004736. - Johannes W. Meijer, Sep 22 2010
A002260 is the self-fission of the polynomial sequence (q(n,x)), where q(n,x) = x^n + x^(n-1) + ... + x + 1. See A193842 for the definition of fission. - Clark Kimberling, Aug 07 2011
Sequence B is called a reluctant sequence of sequence A, if B is triangle array read by rows: row number k coincides with first k elements of the sequence A. Sequence A002260 is reluctant sequence of sequence 1,2,3,... (A000027). - Boris Putievskiy, Dec 12 2012
This is the maximal sequence of positive integers, such that once an integer k has occurred, the number of k's always exceeds the number of (k+1)'s for the remainder of the sequence, with the first occurrence of the integers being in order. - Franklin T. Adams-Watters, Oct 23 2013
A002260 are the k antidiagonal numerators of rationals in Cantor's proof of 1-to-1 correspondence between rationals and naturals; the denominators are k-numerator+1. - Adriano Caroli, Mar 24 2015
T(n,k) gives the distance to the largest triangular number < n. - Ctibor O. Zizka, Apr 09 2020

			First six rows:
  1
  1   2
  1   2   3
  1   2   3   4
  1   2   3   4   5
  1   2   3   4   5   6

Clark Kimberling, "Fractal sequences and interspersions," Ars Combinatoria 45 (1997) 157-168. (Introduces upper trimming, lower trimming, and signature sequences.)
M. Myers, Smarandache Crescendo Subsequences, R. H. Wilde, An Anthology in Memoriam, Bristol Banner Books, Bristol, 1998, p. 19.
F. Smarandache, Sequences of Numbers Involved in Unsolved Problems, Hexis, Phoenix, 2006.

N. J. A. Sloane, Table of n, a(n) for n = 1..11325
Franklin T. Adams-Watters, Doubly Fractal Sequences
Matin Amini and Majid Jahangiri, A Novel Proof for Kimberling's Conjecture on Doubly Fractal Sequences, arXiv:1612.09481 [math.NT], 2017.
Bruno Berselli, Illustration of the initial terms
Jerry Brown et al., Problem 4619, School Science and Mathematics (USA), Vol. 97(4), 1997, pp. 221-222.
Glen Joyce C. Dulatre, Jamilah V. Alarcon, Vhenedict M. Florida, and Daisy Ann A. Disu, On Fractal Sequences, DMMMSU-CAS Science Monitor (2016-2017) Vol. 15 No. 2, 109-113.
Clark Kimberling, Fractal sequences
Clark Kimberling, Numeration systems and fractal sequences, Acta Arithmetica 73 (1995) 103-117.
Boris Putievskiy, Transformations Integer Sequences And Pairing Functions arXiv:1212.2732 [math.CO], 2012.
F. Smarandache, Sequences of Numbers Involved in Unsolved Problems.
Aaron Snook, Augmented Integer Linear Recurrences, 2012. - _N. J. A. Sloane_, Dec 19 2012
Michael Somos, Sequences used for indexing triangular or square arrays
Eric Weisstein's World of Mathematics, Smarandache Sequences
Eric Weisstein's World of Mathematics, Unit Fraction

Cf. A000217, A001710, A002262, A003056, A004736 (ordinal transform), A025581, A056534, A094727, A127779.
Cf. A140756 (alternating signs).
Triangle sums (see the comments): A000217 (Row1, Kn11); A004526 (Row2); A000096 (Kn12); A055998 (Kn13); A055999 (Kn14); A056000 (Kn15); A056115 (Kn16); A056119 (Kn17); A056121 (Kn18); A056126 (Kn19); A051942 (Kn110); A101859 (Kn111); A132754 (Kn112); A132755 (Kn113); A132756 (Kn114); A132757 (Kn115); A132758 (Kn116); A002620 (Kn21); A000290 (Kn3); A001840 (Ca2); A000326 (Ca3); A001972 (Gi2); A000384 (Gi3).
Cf. A108872.

a002260 n k = k
a002260_row n = [1..n]
a002260_tabl = iterate (\row -> map (+ 1) (0 : row)) [1]
-- Reinhard Zumkeller, Aug 04 2014, Jul 03 2012

at:=0; for n from 1 to 150 do for i from 1 to n do at:=at+1; lprint(at,i); od: od: # N. J. A. Sloane, Nov 01 2006
seq(seq(i,i=1..k),k=1..13); # Peter Luschny, Jul 06 2009

FoldList[{#1, #2} &, 1, Range[2, 13]] // Flatten (* Robert G. Wilson v, May 10 2011 *)
Flatten[Table[Range[n],{n,20}]] (* Harvey P. Dale, Jun 20 2013 *)

T(n,k):=sum((i+k)*binomial(i+k-1,i)*binomial(k,n-i-k+1)*(-1)^(n-i-k+1),i,max(0,n+1-2*k),n-k+1); /* Vladimir Kruchinin, Oct 18 2013 */

t1(n)=n-binomial(floor(1/2+sqrt(2*n)),2) /* this sequence */

A002260(n)=n-binomial((sqrtint(8*n)+1)\2,2) \\ M. F. Hasler, Mar 10 2014

from math import isqrt, comb
def A002260(n): return n-comb((m:=isqrt(k:=n<<1))+(k>m*(m+1)),2) # Chai Wah Wu, Nov 08 2024

a(n) = 1 + A002262(n).
n-th term is n - m*(m+1)/2 + 1, where m = floor((sqrt(8*n+1) - 1) / 2).
The above formula is for offset 0; for offset 1, use a(n) = n-m*(m+1)/2 where m = floor((-1+sqrt(8*n-7))/2). - Clark Kimberling, Jun 14 2011
a(k * (k + 1) / 2 + i) = i for k >= 0 and 0 < i <= k + 1. - Reinhard Zumkeller, Aug 14 2001
a(n) = (2*n + round(sqrt(2*n)) - round(sqrt(2*n))^2)/2. - Brian Tenneson, Oct 11 2003
a(n) = n - binomial(floor((1+sqrt(8*n))/2), 2). - Paul Barry, May 25 2004
T(n,k) = A001511(A118413(n,k)); T(n,k) = A003602(A118416(n,k)). - Reinhard Zumkeller, Apr 27 2006
a(A000217(n)) = A000217(n) - A000217(n-1), a(A000217(n-1) + 1) = 1, a(A000217(n) - 1) = A000217(n) - A000217(n-1) - 1. - Alexander R. Povolotsky, May 28 2008
a(A169581(n)) = A038566(n). - Reinhard Zumkeller, Dec 02 2009
T(n,k) = Sum_{i=1..k} i*binomial(k,i)*binomial(n-k,n-i) (regarded as triangle, see the example). - Mircea Merca, Apr 11 2012
T(n,k) = Sum_{i=max(0,n+1-2*k)..n-k+1} (i+k)*binomial(i+k-1,i)*binomial(k,n-i-k+1)*(-1)^(n-i-k+1). - Vladimir Kruchinin, Oct 18 2013
G.f.: x*y / ((1 - x) * (1 - x*y)^2) = Sum_{n,k>0} T(n,k) * x^n * y^k. - Michael Somos, Sep 17 2014
a(n) = n - S(n) where S(n) = sum of distinct terms in {a(1), a(2), ..., a(n-1)}. - David James Sycamore, Mar 10 2025

More terms from Reinhard Zumkeller, Apr 27 2006
Incorrect program removed by Franklin T. Adams-Watters, Mar 19 2010
New name from Omar E. Pol, Jul 15 2012

A212427 a(n) = 17*n + A000217(n-1).

Original entry on oeis.org

0, 17, 35, 54, 74, 95, 117, 140, 164, 189, 215, 242, 270, 299, 329, 360, 392, 425, 459, 494, 530, 567, 605, 644, 684, 725, 767, 810, 854, 899, 945, 992, 1040, 1089, 1139, 1190, 1242, 1295, 1349, 1404, 1460, 1517, 1575, 1634, 1694, 1755, 1817, 1880, 1944, 2009

Offset: 0

Jesse Han, May 16 2012

Generalization: T(n,i) = A000217(i-1+n) - A000217(i-1) = i*n + A000217(n-1); in this case is i=17. See also the comment in A212428.

Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000217, A000096, A001008, A002805, A055998-A056000, A056115, A056119, A056121, A056126, A051942, A101859, A132754-A132758, A212428.

For n > 22, T(n,17) matches A074170 but with opposite sign.

[n*(n+33)/2: n in [0..49]]; // Bruno Berselli, Jun 22 2012

Table[-17 (17 - 1)/2 + (17 + n) (16 + n)/2, {n, 0, 100}]

a(n)=n*(n+33)/2 \\ Charles R Greathouse IV, Jun 17 2017

a(n) = (16+n)*(17+n)/2 - 16*17/2 = 17*n + (n-1)*n/2 = n*(n+33)/2.
G.f.: x*(17-16*x)/(1-x)^3. - Bruno Berselli, Jun 22 2012
a(n) = 17*n - floor(n/2) + floor(n^2/2). - Wesley Ivan Hurt, Jun 15 2013
From Amiram Eldar, Jan 11 2021: (Start)
Sum_{n>=1} 1/a(n) = 2*A001008(33)/(33*A002805(33)) = 53676090078349/216605329340400.
Sum_{n>=1} (-1)^(n+1)/a(n) = 4*log(2)/33 - 14606816124167/340379803249200. (End)
From Elmo R. Oliveira, Dec 12 2024: (Start)
E.g.f.: exp(x)*x*(34 + x)/2.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

A212428 a(n) = 18*n + A000217(n-1).

Original entry on oeis.org

0, 18, 37, 57, 78, 100, 123, 147, 172, 198, 225, 253, 282, 312, 343, 375, 408, 442, 477, 513, 550, 588, 627, 667, 708, 750, 793, 837, 882, 928, 975, 1023, 1072, 1122, 1173, 1225, 1278, 1332, 1387, 1443, 1500, 1558, 1617, 1677, 1738, 1800, 1863, 1927, 1992, 2058

Offset: 0

Jesse Han, May 16 2012

Generalization: T(n,i) = A000217(i-1+n) - A000217(i-1) = i*n + A000217(n-1) (corrected by Zak Seidov, Jun 21 2012); in this case is i=18.

For i = 11..16, Milan Janjic observed that if we define f(n,b,i) = Sum_{k=0..n-b} binomial(n,k)*Stirling1(n-k,b)*Product_{j=0..k-1} (-i - j), then T(n-1,i) = -f(n,n-1,i) for n >= 1.

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

Cf. A000217, A000096, A001008, A002805, A055998-A056000, A056115, A056119, A056121, A056126, A051942, A101859, A132754-A132758, A212427.

[n*(n+35)/2: n in [0..48]]; // Bruno Berselli, Jun 21 2012

Table[-18 (18 - 1)/2 + (18 + n) (17 + n)/2, {n, 0, 100}]
LinearRecurrence[{3,-3,1},{0,18,37},60] (* Harvey P. Dale, Jun 09 2024 *)

a(n)=n*(n+35)/2 \\ Charles R Greathouse IV, Jun 17 2017

a(n) = (17+n)*(18+n)/2 - 17*18/2 = 18*n + (n-1)*n/2 = n*(n+35)/2.
G.f.: x*(18-17*x)/(1-x)^3. - Bruno Berselli, Jun 21 2012
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Vincenzo Librandi, Jul 10 2012
a(n) = 18*n - floor(n/2) + floor(n^2/2). - Wesley Ivan Hurt, Jun 15 2013
From Amiram Eldar, Jan 11 2021: (Start)
Sum_{n>=1} 1/a(n) = 2*A001008(35)/(35*A002805(35)) = 54437269998109/229732925058000.
Sum_{n>=1} (-1)^(n+1)/a(n) = 4*log(2)/35 - 102126365345729/2527062175638000. (End)
E.g.f.: exp(x)*x*(36 + x)/2. - Elmo R. Oliveira, Dec 12 2024

A132773 a(n) = n*(n + 31).

Original entry on oeis.org

0, 32, 66, 102, 140, 180, 222, 266, 312, 360, 410, 462, 516, 572, 630, 690, 752, 816, 882, 950, 1020, 1092, 1166, 1242, 1320, 1400, 1482, 1566, 1652, 1740, 1830, 1922, 2016, 2112, 2210, 2310, 2412, 2516, 2622, 2730, 2840, 2952, 3066, 3182, 3300, 3420, 3542, 3666

Offset: 0

Omar E. Pol, Aug 28 2007

Felix P. Muga II, Extending the Golden Ratio and the Binet-de Moivre Formula, Preprint on ResearchGate, March 2014.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001008, A002378, A005563, A028347, A028552, A028557, A028560, A028563, A028566, A028569.
Cf. A098603, A098847, A098848, A098849, A098850, A102928, A120071, A132758, A132759, A132760.
Cf. A132761, A132762, A132763, A132764, A132765, A132766, A132767, A132768, A132769, A132770.
Cf. A132771, A132772.

Table[n*(n + 31), {n, 0, 100}] (* Wesley Ivan Hurt, Apr 16 2024 *)

a(n)=n*(n+31) \\ Charles R Greathouse IV, Jun 17 2017

G.f.: 2*x*(-16+15*x)/(-1+x)^3. - R. J. Mathar, Nov 14 2007
a(n) = 2*A132758(n). - R. J. Mathar, Jul 22 2009
a(n) = 2*n + a(n-1) + 30, with n > 0, a(0)=0. - Vincenzo Librandi, Aug 03 2010
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(31)/31 = A001008(31)/A102928(31) = 290774257297357/2238255069850800, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2)/31 - 7313175618421/319750724264400. (End)
From Elmo R. Oliveira, Dec 13 2024: (Start)
E.g.f.: exp(x)*x*(32 + x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

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

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 9, 9, 10, 16, 17, 15, 14, 15, 32, 33, 27, 22, 20, 21, 64, 65, 51, 38, 30, 27, 28, 128, 129, 99, 70, 50, 39, 35, 36, 256, 257, 195, 134, 90, 63, 49, 44, 45, 512, 513, 387, 262, 170, 111, 77, 60, 54, 55, 1024, 1025, 771, 518, 330, 207, 133, 92, 72, 65, 66

Offset: 1

Boris Putievskiy, Jan 15 2013

Column number 1 A000217 n*(n+1)/2,
column number 2 A000096 n*(n+3)/2,
column number 3 A055999 n*(n+7)/2,
column number 4 A056121 n*(n+15)/2,
column number 5 A132758 n*(n+31)/2.
Row number 1 A000079 2^k,
row number 2 A000051 2^k + 1.

			The start of the sequence as table:
  1....2...4...8...16...32...64...
  3....5...9..17...33...65..129...
  6....9..15..27...51...99..195...
  10..14..22..38...70..134..262...
  15..20..30..50...90..170..330...
  21..27..39..63..111..207..399...
  28..35..49..77..133..245..469...
  . . .
The start of the sequence as triangle array read by rows:
  1;
  2,3;
  4,5,6;
  8,9,9,10;
  16,17,15,14,15;
  32,33,27,22,20,21;
  64,65,51,38,30,27,28;
  . . .
Row number r contains r numbers.

Boris Putievskiy, Rows n = 1..140 of triangle, flattened
Boris Putievskiy, Transformations [of] Integer Sequences And Pairing Functions arXiv:1212.2732 [math.CO], 2012.

Cf. A000217, A000096, A055999, A056121, A132758, A000079, A000051.

b[n_] := n - d[n]*(d[n] + 1)/2; c[n_] := (d[n]^2 + 3*d[n] + 4)/2 - n; d[n_] := Floor[(-1 + Sqrt[8*n - 7])/2]; a[n_] := b[n]*(b[n] + 2^c[n] - 1)/2; Table[a[n], {n, 1, 50}] (* G. C. Greubel, Jan 04 2018 *)

a(n, k) = n*(n+2^k-1)/2
array(rows, cols) = for(x=1, rows, for(y=1, cols, print1(a(x, y), ", ")); print(""))
/* Print initial 7 rows and 8 columns of table as follows */
array(7, 8) \\ Felix Fröhlich, Jan 05 2018

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

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

A303273 Array T(n,k) = binomial(n, 2) + k*n + 1 read by antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 1, 3, 4, 4, 1, 4, 6, 7, 7, 1, 5, 8, 10, 11, 11, 1, 6, 10, 13, 15, 16, 16, 1, 7, 12, 16, 19, 21, 22, 22, 1, 8, 14, 19, 23, 26, 28, 29, 29, 1, 9, 16, 22, 27, 31, 34, 36, 37, 37, 1, 10, 18, 25, 31, 36, 40, 43, 45, 46, 46, 1, 11, 20, 28, 35, 41

Offset: 0

Franck Maminirina Ramaharo, Apr 20 2018

Columns are linear recurrence sequences with signature (3,-3,1).
8*T(n,k) + A166147(k-1) are squares.
Columns k are binomial transforms of [1, k, 1, 0, 0, 0, ...].
Antidiagonals sums yield A116731.

			The array T(n,k) begins
1    1    1    1    1    1    1    1    1    1    1    1    1  ...  A000012
1    2    3    4    5    6    7    8    9   10   11   12   13  ...  A000027
2    4    6    8   10   12   14   16   18   20   22   24   26  ...  A005843
4    7   10   13   16   19   22   25   28   31   34   37   40  ...  A016777
7   11   15   19   23   27   31   35   39   43   47   51   55  ...  A004767
11  16   21   26   31   36   41   46   51   56   61   66   71  ...  A016861
16  22   28   34   40   46   52   58   64   70   76   82   88  ...  A016957
22  29   36   43   50   57   64   71   78   85   92   99  106  ...  A016993
29  37   45   53   61   69   77   85   93  101  109  117  125  ...  A004770
37  46   55   64   73   82   91  100  109  118  127  136  145  ...  A017173
46  56   66   76   86   96  106  116  126  136  146  156  166  ...  A017341
56  67   78   89  100  111  122  133  144  155  166  177  188  ...  A017401
67  79   91  103  115  127  139  151  163  175  187  199  211  ...  A017605
79  92  105  118  131  144  157  170  183  196  209  222  235  ...  A190991
...
The inverse binomial transforms of the columns are
1    1    1    1    1    1    1    1    1    1    1    1    1  ...
0    1    2    3    4    5    6    7    8    9   10   11   12  ...
1    1    1    1    1    1    1    1    1    1    1    1    1  ...
0    0    0    0    0    0    0    0    0    0    0    0    0  ...
0    0    0    0    0    0    0    0    0    0    0    0    0  ...
0    0    0    0    0    0    0    0    0    0    0    0    0  ...
...
T(k,n-k) = A087401(n,k) + 1 as triangle
1
1   1
1   2   2
1   3   4   4
1   4   6   7   7
1   5   8  10  11  11
1   6  10  13  15  16  16
1   7  12  16  19  21  22  22
1   8  14  19  23  26  28  29  29
1   9  16  22  27  31  34  36  37  37
1  10  18  25  31  36  40  43  45  46  46
...

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 1994.

Cf. A085475, A086270, A086271, A086272, A086273, A130154, A159798, A162609, A162610, A300401.

T := (n, k) -> binomial(n, 2) + k*n + 1;
for n from 0 to 20 do seq(T(n, k), k = 0 .. 20) od;

Table[With[{n = m - k}, Binomial[n, 2] + k n + 1], {m, 0, 11}, {k, m, 0, -1}] // Flatten (* Michael De Vlieger, Apr 21 2018 *)

T(n, k) := binomial(n, 2)+ k*n + 1$
for n:0 thru 20 do
    print(makelist(T(n, k), k, 0, 20));

T(n,k) = binomial(n, 2) + k*n + 1;
tabl(nn) = for (n=0, nn, for (k=0, nn, print1(T(n, k), ", ")); print); \\ Michel Marcus, May 17 2018

G.f.: (3*x^2*y - 3*x*y + y - 2*x^2 + 2*x - 1)/((x - 1)^3*(y - 1)^2).
E.g.f.: (1/2)*(2*x*y + x^2 + 2)*exp(y + x).
T(n,k) = 3*T(n-1,k) - 3*T(n-2,k) + T(n-3,k), with T(0,k) = 1, T(1,k) = k + 1 and T(2,k) = 2*k + 2.
T(n,k) = T(n-1,k) + n + k - 1.
T(n,k) = T(n,k-1) + n, with T(n,0) = 1.
T(n,0) = A152947(n+1).
T(n,1) = A000124(n).
T(n,2) = A000217(n).
T(n,3) = A034856(n+1).
T(n,4) = A052905(n).
T(n,5) = A051936(n+4).
T(n,6) = A246172(n+1).
T(n,7) = A302537(n).
T(n,8) = A056121(n+1) + 1.
T(n,9) = A056126(n+1) + 1.
T(n,10) = A051942(n+10) + 1, n > 0.
T(n,11) = A101859(n) + 1.
T(n,12) = A132754(n+1) + 1.
T(n,13) = A132755(n+1) + 1.
T(n,14) = A132756(n+1) + 1.
T(n,15) = A132757(n+1) + 1.
T(n,16) = A132758(n+1) + 1.
T(n,17) = A212427(n+1) + 1.
T(n,18) = A212428(n+1) + 1.
T(n,n) = A143689(n) = A300192(n,2).
T(n,n+1) = A104249(n).
T(n,n+2) = T(n+1,n) = A005448(n+1).
T(n,n+3) = A000326(n+1).
T(n,n+4) = A095794(n+1).
T(n,n+5) = A133694(n+1).
T(n+2,n) = A005449(n+1).
T(n+3,n) = A115067(n+2).
T(n+4,n) = A133694(n+2).
T(2*n,n) = A054556(n+1).
T(2*n,n+1) = A054567(n+1).
T(2*n,n+2) = A033951(n).
T(2*n,n+3) = A001107(n+1).
T(2*n,n+4) = A186353(4*n+1) (conjectured).
T(2*n,n+5) = A184103(8*n+1) (conjectured).
T(2*n,n+6) = A250657(n-1) = A250656(3,n-1), n > 1.
T(n,2*n) = A140066(n+1).
T(n+1,2*n) = A005891(n).
T(n+2,2*n) = A249013(5*n+4) (conjectured).
T(n+3,2*n) = A186384(5*n+3) = A186386(5*n+3) (conjectured).
T(2*n,2*n) = A143689(2*n).
T(2*n+1,2*n+1) = A143689(2*n+1) (= A030503(3*n+3) (conjectured)).
T(2*n,2*n+1) = A104249(2*n) = A093918(2*n+2) = A131355(4*n+1) (= A030503(3*n+5) (conjectured)).
T(2*n+1,2*n) = A085473(n).
a(n+1,5*n+1)=A051865(n+1) + 1.
a(n,2*n+1) = A116668(n).
a(2*n+1,n) = A054569(n+1).
T(3*n,n) = A025742(3*n-1), n > 1 (conjectured).
T(n,3*n) = A140063(n+1).
T(n+1,3*n) = A069099(n+1).
T(n,4*n) = A276819(n).
T(4*n,n) = A154106(n-1), n > 0.
T(2^n,2) = A028401(n+2).
T(1,n)*T(n,1) = A006000(n).
T(n*(n+1),n) = A211905(n+1), n > 0 (conjectured).
T(n*(n+1)+1,n) = A294259(n+1).
T(n,n^2+1) = A081423(n).
T(n,A000217(n)) = A158842(n), n > 0.
T(n,A152947(n+1)) = A060354(n+1).
floor(T(n,n/2)) = A267682(n) (conjectured).
floor(T(n,n/3)) = A025742(n-1), n > 0 (conjectured).
floor(T(n,n/4)) = A263807(n-1), n > 0 (conjectured).
ceiling(T(n,2^n)/n) = A134522(n), n > 0 (conjectured).
ceiling(T(n,n/2+n)/n) = A051755(n+1) (conjectured).
floor(T(n,n)/n) = A133223(n), n > 0 (conjectured).
ceiling(T(n,n)/n) = A007494(n), n > 0.
ceiling(T(n,n^2)/n) = A171769(n), n > 0.
ceiling(T(2*n,n^2)/n) = A046092(n), n > 0.
ceiling(T(2*n,2^n)/n) = A131520(n+2), n > 0.

cp's OEIS Frontend

A002260 Triangle read by rows: T(n,k) = k for n >= 1, k = 1..n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Maxima

PARI

PARI

Python

Formula

Extensions

A212427 a(n) = 17*n + A000217(n-1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A212428 a(n) = 18*n + A000217(n-1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A132773 a(n) = n*(n + 31).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A303273 Array T(n,k) = binomial(n, 2) + k*n + 1 read by antidiagonals.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

Maple

Mathematica

Maxima

PARI