A014106 -id:A014106 - cp's OEIS frontend

A154105 a(n) = 12n^2 + 18n + 7.

7, 37, 91, 169, 271, 397, 547, 721, 919, 1141, 1387, 1657, 1951, 2269, 2611, 2977, 3367, 3781, 4219, 4681, 5167, 5677, 6211, 6769, 7351, 7957, 8587, 9241, 9919, 10621, 11347, 12097, 12871, 13669, 14491, 15337, 16207, 17101, 18019, 18961, 19927, 20917, 21931

Offset: 0

Klaus Brockhaus, Jan 04 2009

a(n) is the number of partitions with three integral dissimilar components of the number 12(n+1), e.g for n=0, 12 may be partitioned in the 7 ways (1,2,9), (1,3,8), (1,4,7), (1,5,6), (2,3,7), (2,4,6) and (3,4,5). - Ian Duff, Jan 31 2010

Sequence found by reading the line from 7, in the direction 7, 37, ..., in the square spiral whose vertices are the generalized octagonal numbers A001082. - Omar E. Pol, May 08 2018

			a(2) = 12*2^2 + 18*2 + 7 = 91 = 6*14 + 7 = 6*A014106(2) + 7.
a(3) = a(2) + 24*3 + 6 = 91 + 72 + 6 = 169.
a(-4) = 12*4^2 - 18*4 + 7 = 127 = 2*64 - 1 = 2*A085473(3) - 1.

Vincenzo Librandi, Table of n, a(n) for n = 0..3000
John Elias, Animated Illustration: Starburst Hexagrams
Leo Tavares, Illustration: Hexagonal Halos
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001082, A014106, A152746, A153286, A085473.

Cf. A003215, A000290, A000217.

Magma
```
[ 12*n^2+18*n+7: n in [0..40] ];
```

Table[12*n^2 + 18*n + 7, {n, 0, 42}] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2012 *)
LinearRecurrence[{3,-3,1}, {7,37,91}, 25] (* G. C. Greubel, Sep 02 2016 *)

a(n)=12*n^2+18*n+7 \\ Charles R Greathouse IV, Sep 02 2016

G.f.: (7 + 16*x + x^2)/(1-x)^3.
a(n) = 6*A014106(n) + 7.
a(0) = 7; for n > 0, a(n) = a(n-1) + 24*n + 6.
a(-n-1) = 2*A085473(n) - 1. - Bruno Berselli, Sep 05 2011
E.g.f.: (7 + 30*x + 12*x^2)*exp(x). - G. C. Greubel, Sep 02 2016
a(n) = 1 + A152746(n+1). - Omar E. Pol, May 08 2018
a(n) = A003215(n) + 6*A000290(n+1) + 6*A000217(n). - Leo Tavares, Sep 12 2022

A286785 Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.

Original entry on oeis.org

1, 2, 5, 2, 14, 14, 2, 42, 72, 27, 2, 132, 330, 220, 44, 2, 429, 1430, 1430, 520, 65, 2, 1430, 6006, 8190, 4550, 1050, 90, 2, 4862, 24752, 43316, 33320, 11900, 1904, 119, 2, 16796, 100776, 217056, 217056, 108528, 27132, 3192, 152, 2, 58786, 406980, 1046520, 1302336, 854658, 301644, 55860, 5040, 189, 2, 208012, 1634380, 4903140, 7354710, 6056820, 2826516, 743820, 106260, 7590, 230, 2

Offset: 0

Gheorghe Coserea, May 15 2017

Row n>0 contains n terms.

T(n,k) is the number of Feynman's diagrams with k fermionic loops in the order n of the perturbative expansion in dimension zero for the GW approximation of the polarization function in a many-body theory of fermions with two-body interaction (see Molinari link).

			A(x;t) = 1 + 2*x + (5 + 2*t)*x^2 + (14 + 14*t + 2*t^2)*x^3 + ...
Triangle starts:
   n\k |     0       1       2       3       4      5     6    7  8
  -----+-----------------------------------------------------------
   0   |     1;
   1   |     2;
   2   |     5,      2;
   3   |    14,     14,      2;
   4   |    42,     72,     27,      2;
   5   |   132,    330,    220,     44,      2;
   6   |   429,   1430,   1430,    520,     65,     2;
   7   |  1430,   6006,   8190,   4550,   1050,    90,    2;
   8   |  4862,  24752,  43316,  33320,  11900,  1904,  119,   2;
   9   | 16796, 100776, 217056, 217056, 108528, 27132, 3192, 152, 2;

Gheorghe Coserea, Rows n = 0..123, flattened

Cf. A000108, A286781, A286782, A286783.

T(n,k):=(binomial(n-1,k)*binomial(2*(n+1),n-k))/(n+1); /* Vladimir Kruchinin, Jan 14 2022 */

A286784_ser(N,t='t) = my(x='x+O('x^N)); serreverse(Ser(x*(1-x)^2/(1+(t-1)*x)))/x;
A286785_ser(N,t='t) = 1/(1-x*A286784_ser(N,t))^2;
concat(apply(p->Vecrev(p), Vec(A286785_ser(12))))

y(x;t) = Sum_{n>=0} P_n(t)*x^n = 1/(1-x*s)^2, where s(x;t) = A286784(x;t) and P_n(t) = Sum_{k=0..n-1} T(n,k)*t^k for n>0.
A000108(n+1) = T(n,0), A002058(n+3) = T(n,1), A014106(n-1) = T(n,n-2), A006013(n) = P_n(1), A211789(n+1) = P_n(2).
T(n,k) = C(n-1,k)*C(2*n+2,n-k)/(n+1). - Vladimir Kruchinin, Jan 14 2022

A317304 Numbers k with the property that both Dyck paths of the symmetric representation of sigma(k) have a central valley.

Original entry on oeis.org

4, 5, 11, 12, 13, 14, 22, 23, 24, 25, 26, 27, 37, 38, 39, 40, 41, 42, 43, 44, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149

Offset: 1

Omar E. Pol, Aug 27 2018

Also triangle read by rows which gives the even-indexed rows of triangle A014132.
There are no triangular number (A000217) in this sequence.
For more information about the symmetric representation of sigma see A237593 and its related sequences.
Equivalently, numbers k with the property that both Dyck paths of the symmetric representation of sigma(k) have an even number of peaks. - Omar E. Pol, Sep 13 2018

			Written as an irregular triangle in which the row lengths are the positive even numbers, the sequence begins:
    4,   5;
   11,  12,  13,  14;
   22,  23,  24,  25,  26,  27;
   37,  38,  39,  40,  41,  42,  43,  44;
   56,  57,  58,  59,  60,  61,  62,  63,  64,  65;
   79,  80,  81,  82,  83,  84,  85,  86,  87,  88,  89,  90;
  106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119;
...
Illustration of initial terms:
-------------------------------------------------
   k  sigma(k)  Diagram of the symmetry of sigma
-------------------------------------------------
                       _ _           _ _ _ _
                      | | |         | | | | |
                     _| | |         | | | | |
                 _ _|  _|_|         | | | | |
   4      7     |_ _ _|             | | | | |
   5      6     |_ _ _|             | | | | |
                                 _ _|_| | | |
                               _|    _ _|_| |
                             _|     |  _ _ _|
                            |      _|_|
                 _ _ _ _ _ _|  _ _|
  11     12     |_ _ _ _ _ _| |  _|
  12     28     |_ _ _ _ _ _ _| |
  13     14     |_ _ _ _ _ _ _| |
  14     24     |_ _ _ _ _ _ _ _|
.
For the first six terms of the sequence we can see in the above diagram that both Dyck path (the smallest and the largest) of the symmetric representation of sigma(k) have a central valley.
Compare with A317303.

Row sums give A084367. n >= 1.
Column 1 gives A084849, n >= 1.
Column 2 gives A096376, n >= 1.
Right border gives the nonzero terms of A014106.
The union of A000217, A317303 and this sequence gives A001477.
Some other sequences related to the central peak or the central valley of the symmetric representation of sigma are A000217, A000384, A007606, A007607, A014105, A014132, A162917, A161983, A317303. See also A317306.
Cf. A000203, A005843, A196020, A236104, A235791, A237048, A237591, A237593, A237270, A237271, A239660, A239931, A239932, A239933, A239934, A244050, A245092, A249351, A262626.

A139580 a(n) = n(2n + 17).

Original entry on oeis.org

0, 19, 42, 69, 100, 135, 174, 217, 264, 315, 370, 429, 492, 559, 630, 705, 784, 867, 954, 1045, 1140, 1239, 1342, 1449, 1560, 1675, 1794, 1917, 2044, 2175, 2310, 2449, 2592, 2739, 2890, 3045, 3204, 3367, 3534, 3705, 3880, 4059

Offset: 0

Omar E. Pol, May 19 2008

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

Cf. A014105, A014106, A033537, A130861, A139576, A139577, A139578, A139579, A139581.

a[n_]:=Sum[4*i+15, {i, 1, n}]; (* Vladimir Joseph Stephan Orlovsky, Dec 04 2008 *)
Table[n(2n+17),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,19,42},50] (* Harvey P. Dale, Jul 07 2024 *)

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

a(n) = 2*n^2 + 17*n.
a(n) = a(n-1) + 4*n + 15; a(0) = 0. - Vincenzo Librandi, Nov 24 2010
From Elmo R. Oliveira, Nov 29 2024: (Start)
G.f.: x*(19 - 15*x)/(1-x)^3.
E.g.f.: exp(x)*x*(19 + 2*x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

A139581 a(n) = n(2n + 19).

Original entry on oeis.org

0, 21, 46, 75, 108, 145, 186, 231, 280, 333, 390, 451, 516, 585, 658, 735, 816, 901, 990, 1083, 1180, 1281, 1386, 1495, 1608, 1725, 1846, 1971, 2100, 2233, 2370, 2511, 2656, 2805, 2958, 3115, 3276, 3441, 3610, 3783, 3960, 4141

Offset: 0

Omar E. Pol, May 19 2008

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

Cf. A014105, A014106, A033537, A130861, A139576, A139577, A139578, A139579, A139580.

Table[n(2n+19),{n,0,50}]  (* Harvey P. Dale, Jan 26 2011 *)

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

a(n) = 2*n^2 + 19*n.
a(n) = a(n-1) + 4*n + 17 (with a(0)=0). - Vincenzo Librandi, Nov 24 2010
From Elmo R. Oliveira, Nov 29 2024: (Start)
G.f.: x*(21 - 17*x)/(1-x)^3.
E.g.f.: exp(x)*x*(21 + 2*x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

A156140 Accumulation of Stern's diatomic series: a(0)=-1, a(1)=0, and a(n+1) = (2e(n)+1)*a(n) - a(n-1) for n > 1, where e(n) is the highest power of 2 dividing n.

Original entry on oeis.org

-1, 0, 1, 3, 2, 7, 5, 8, 3, 13, 10, 17, 7, 18, 11, 15, 4, 21, 17, 30, 13, 35, 22, 31, 9, 32, 23, 37, 14, 33, 19, 24, 5, 31, 26, 47, 21, 58, 37, 53, 16, 59, 43, 70, 27, 65, 38, 49, 11, 50, 39, 67, 28, 73, 45, 62, 17, 57, 40, 63, 23, 52, 29, 35, 6, 43, 37, 68, 31, 87, 56, 81, 25, 94, 69

Offset: 0

Arie Werksma (Werksma(AT)Tiscali.nl), Feb 04 2009

Charles R Greathouse IV, Table of n, a(n) for n = 0..10000

Cf. A002487, A007814.
From Yosu Yurramendi, Mar 09 2018: (Start)
a(2^m +  0) = A000027(m),   m >= 0.
a(2^m +  1) = A002061(m+2), m >= 1.
a(2^m +  2) = A002522(m),   m >= 2.
a(2^m +  3) = A033816(m-1), m >= 2.
a(2^m +  4) = A002061(m),   m >= 2.
a(2^m +  5) = A141631(m),   m >= 3.
a(2^m +  6) = A084849(m-1), m >= 3.
a(2^m +  7) = A056108(m-1), m >= 3.
a(2^m +  8) = A000290(m-1), m >= 3.
a(2^m +  9) = A185950(m-1), m >= 4.
a(2^m + 10) = A144390(m-1), m >= 4.
a(2^m + 12) = A014106(m-2), m >= 4.
a(2^m + 16) = A028387(m-3), m >= 4.
a(2^m + 18) = A250657(m-4), m >= 5.
a(2^m + 20) = A140677(m-3), m >= 5.
a(2^m + 32) = A028872(m-2), m >= 5.
a(2^m -  1) = A005563(m-1), m >= 0.
a(2^m -  2) = A028387(m-2), m >= 2.
a(2^m -  3) = A033537(m-2), m >= 2.
a(2^m -  4) = A008865(m-1), m >= 3.
a(2^m -  7) = A140678(m-3), m >= 3.
a(2^m -  8) = A014209(m-3), m >= 4.
a(2^m - 16) = A028875(m-2), m >= 5.
a(2^m - 32) = A108195(m-5), m >= 6.
(End)

A156140 := proc(n)
    option remember ;
    if n <= 1 then
        n-1 ;
    else
        (2*A007814(n-1)+1)*procname(n-1)-procname(n-2) ;
    end if;
end proc:
seq(A156140(n),n=0..80) ; # R. J. Mathar, Mar 14 2009

Fold[Append[#1, (2 IntegerExponent[#2, 2] + 1) #1[[-1]] - #1[[-2]] ] &, {-1, 0}, Range[73]] (* Michael De Vlieger, Mar 09 2018 *)

first(n)=my(v=vector(n+1)); v[1]=-1; v[2]=0; for(k=1,n-1,v[k+2]=(2*valuation(k,2)+1)*v[k+1] - v[k]); v \\ Charles R Greathouse IV, Apr 05 2016

fusc(n)=my(a=1, b=0); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); b
a(n)=my(m=1,s,t); if(n==0, return(-1)); while(n%2==0, s+=fusc(n>>=1)); while(n>1, t=logint(n,2); n-=2^t; s+=m*fusc(n)*(t^2+t+1); m*=-t); m*(n-1) + s \\ Charles R Greathouse IV, Dec 13 2016

a <- c(0,1)
maxlevel <- 6 # by choice
for(m in 1:maxlevel) {
  a[2^(m+1)] <- m + 1
  for(k in 1:(2^m-1)) {
    r <- m - floor(log2(k)) - 1
    a[2^r*(2*k+1)] <- a[2^r*(2*k)] + a[2^r*(2*k+2)]
}}
a
# Yosu Yurramendi, May 08 2018

Let b(n) = A002487(n), Stern's diatomic series.
a(n+1)*b(n) - a(n)*b(n+1) = 1 for n >= 0.
a(2n+1) = a(n) + a(n+1) + b(n) + b(n+1) for n >= 0.
a(2n) = a(n) + b(n) for n >= 0.
a(2^n + k) = -n*a(k) + (n^2 + n + 1)*b(k) for 0 <= k <= 2^n.
b(2^n + k) = -a(k) + (n + 1)*b(k) for 0 <= k <= 2^n.
a(2^m + k) = b(2^m+k)*m + b(k), m >= 0, 0 <= k < 2^m. - Yosu Yurramendi, Mar 09 2018
a(2^(m+1)+2^m+1) = 2*m+1, m >= 0. - Yosu Yurramendi, Mar 09 2018
From Yosu Yurramendi, May 08 2018: (Start)
a(2^m) = m, m >= 0.
a(2^r*(2*k+1)) = a(2^r*(2*k)) + a(2^r*(2*k+2)), r = m - floor(log_2(k)) - 1, m > 0, 1 <= k < 2^m.
(End)

A161983 Irregular triangle read by rows: the group of 2n + 1 integers starting at A014105(n).

Original entry on oeis.org

0, 3, 4, 5, 10, 11, 12, 13, 14, 21, 22, 23, 24, 25, 26, 27, 36, 37, 38, 39, 40, 41, 42, 43, 44, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 136, 137

Offset: 0

Juri-Stepan Gerasimov, Jun 23 2009

The squares of numbers in each row can be gathered in an equation with the first n terms on one side, the next n+1 terms on the other. The third row, for example, could be rendered as 10^2 + 11^2 + 12^2 = 13^2 + 14^2.
This sequence contains all nonnegative integers that are within a distance of n from 2n^2 + 2n where n is any nonnegative integer. The nonnegative integers that are not in this sequence are of the form 2n^2 + k where n is any positive integer and -n <= k <= n-1. Also, when n is the product of two consecutive integers, a(n) = 2n; for example, a(20) = 40. See explicit formulas for the sequence in the formula section below. - Dennis P. Walsh, Aug 09 2013
Numbers k with the property that the largest Dyck path of the symmetric representation of sigma(k) has a central valley, n > 0. (Cf. A237593.) - Omar E. Pol, Aug 28 2018

			Triangle begins:
   0;
   3,  4,  5;
  10, 11, 12, 13, 14;
  21, 22, 23, 24, 25, 26, 27;
  36, 37, 38, 39, 40, 41, 42, 43, 44;
  55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65;
  78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90;
...

Michael Boardman, Proof Without Words: Pythagorean Runs, Math. Mag., 73 (2000), 59.

Union of A014105 and A317304.
The complement is A162917.
Column 1 gives A014105.
Right border gives A014106.
Row sums give the even-indexed terms of A027480.
Cf. A000290, A014105, A014106, A027480, A162917, A237593, A317304.

seq(seq(2*n^2+2*n+k,k=-n..n),n=0..10); # Dennis P. Walsh, Aug 09 2013
seq(n+floor(sqrt(n))*(floor(sqrt(n))+1),n=0..100); # Dennis P. Walsh, Aug 09 2013

As a triangle, T(n,k) = 2n^2 + 2n + k where -n <= k <= n and n = 0,1,... - Dennis P. Walsh, Aug 09 2013

As sequence, a(n) = n + floor(sqrt(n))*(floor(sqrt(n)) + 1); equivalently, a(n) = n + A000196(n)*(A000196(n)+1). - Dennis P. Walsh, Aug 09 2013

Definition clarified, 8th row terms corrected by R. J. Mathar, Jul 19 2009

A185871 (Even,even)-polka dot array in the natural number array A000027, by antidiagonals.

Original entry on oeis.org

5, 12, 14, 23, 25, 27, 38, 40, 42, 44, 57, 59, 61, 63, 65, 80, 82, 84, 86, 88, 90, 107, 109, 111, 113, 115, 117, 119, 138, 140, 142, 144, 146, 148, 150, 152, 173, 175, 177, 179, 181, 183, 185, 187, 189, 212, 214, 216, 218, 220, 222, 224, 226, 228, 230, 255, 257, 259, 261, 263, 265, 267, 269, 271, 273, 275, 302, 304, 306, 308, 310, 312, 314, 316, 318, 320, 322, 324, 353, 355, 357, 359, 361, 363, 365, 367, 369, 371, 373, 375, 377, 408, 410, 412, 414, 416, 418, 420, 422, 424, 426, 428, 430, 432, 434

Offset: 1

Clark Kimberling, Feb 05 2011

This is the fourth of four polka dot arrays in the natural number array A000027.  See A185868.
row 1: A096376
col 1: A014106
col 2: A071355
diag (5,25,...): A080856
diag (12,40,...): A033586
antidiagonal sums: A048395 (sums of consecutive squares)

			Northwest corner:
  5....12...23...38...57
  14...25...40...59...82
  27...42...61...84...111
  44...63...86...113..144

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened

Cf. A000027 (as an array), A185868, A185869, A185870.

f[n_,k_]:=2n+(n+k-1)(2n+2k-1);
TableForm[Table[f[n,k],{n,1,10},{k,1,15}]]
Table[f[n-k+1,k],{n,14},{k,n,1,-1}]//Flatten

from math import comb, isqrt
def A185871(n):
    a = (m:=isqrt(k:=n<<1))+(k>m*(m+1))
    x = n-comb(a,2)
    y = a-x+1
    return y*((y+(c:=x<<1)<<1)-3)+x*(c-1)+1 # Chai Wah Wu, Jun 18 2025

T(n,k) = 2*n + (n+k-1)*(2*n+2*k-1), k>=1, n>=1.

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

Original entry on oeis.org

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

Offset: 1

Boris Putievskiy, Feb 08 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(1,3), T(2,2), T(3,1);
T(1,2), T(2,1);
. . .
T(1,n), T(2,n-1), T(3,n-2), ... T(n,1);
T(1,n-1), T(2,n-3), T(3,n-4),...T(n-1,1);
. . .
First row  matches with the elements antidiagonal {T(1,n), ... T(n,1)},
second row matches with the elements antidiagonal {T(1,n-1), ... T(n-1,1)}.
Table contains:
row  1 is alternation of elements A130883 and A096376,
row  2  accommodates elements A033816 in even places,
row  3  accommodates elements A100037 in odd  places,
row  5  accommodates elements A100038 in odd  places;
column 1 is alternation of elements A084849 and  A000384,
column 2 is alternation of elements A014106 and  A014105,
column 3 is alternation of elements A014107 and  A091823,
column 4 is alternation of elements A071355 and |A168244|,
column 5 accommodates elements A033537 in even places,
column 7 is alternation of elements A100040 and  A130861,
column 9 accommodates elements A100041 in even places;
the main diagonal is A058331,
diagonal  1, located above the main diagonal is  A001844,
diagonal  2, located above the main diagonal is  A001105,
diagonal  3, located above the main diagonal is  A046092,
diagonal  4, located above the main diagonal is  A056220,
diagonal  5, located above the main diagonal is  A142463,
diagonal  6, located above the main diagonal is  A054000,
diagonal  7, located above the main diagonal is  A090288,
diagonal  9, located above the main diagonal is  A059993,
diagonal 10, located above the main diagonal is |A147973|,
diagonal 11, located above the main diagonal is  A139570;
diagonal  1, located under the main diagonal is  A051890,
diagonal  2, located under the main diagonal is  A005893,
diagonal  3, located under the main diagonal is  A097080,
diagonal  4, located under the main diagonal is  A093328,
diagonal  5, located under the main diagonal is  A137882.

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

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. A130883, A096376, A033816, A100037, A100038, A084849, A000384, A014106, A014105, A014107, A091823, A071355, A168244, A033537, A100040, A130861, A100041, A058331, A001844, A001105, A046092, A056220, A142463, A054000, A090288, A059993, A147973, A139570, A051890, A005893, A097080, A093328, A137882.

T[n_, k_] := (n+k)(n+k-1)/2 - (-1)^(n+k)(n+k-1) - k + 2;
Table[T[n-k+1, k], {n, 1, 12}, {k, n, 1, -1}] // Flatten (* Jean-François Alcover, Dec 06 2018 *)

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

T(n,k) = (k+n)*(k+n-1)/2-(k+n-1)*(-1)^(k+n)-k+2.
As linear sequence
a(n) = A003057(n)*A002024(n)/2- A002024(n)*(-1)^A003056(n)-A004736(n)+2.
a(n) = (t+2)*(t+1)/2 - (t+1)*(-1)^t-j+2, where j=(t*t+3*t+4)/2-n and t=int((math.sqrt(8*n-7) - 1)/ 2).

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

Original entry on oeis.org

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

Offset: 1

Boris Putievskiy, Feb 14 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(1,3), T(2,2), T(1,2), T(2,1), T(3,1);
. . .
T(1,n), T(2,n-1), T(1,n-1), T(2,n-2), T(3,n-2), T(4,n-3)...T(n,1);
...
Descent by snake along two adjacent antidiagonals - step to the southwest, step to the north, step to the southwest, step to the south and so on. The length of each step is 1. Phase four steps is rotated 90 degrees counterclockwise and the mirror of the phase A211377.
Table contains the following:
row 1 is alternation of elements A130883 and A100037,
row 2 accommodates elements A033816 in even places;
column 1 is alternation of elements A000384 and A014106,
column 2 is alternation of elements A091823 and A071355,
column 4 accommodates elements A130861 in odd places;
main diagonal is alternation of elements A188135 and A033567,
diagonal 1, located above the main diagonal, accommodates elements A033585 in even places,
diagonal 2, located above the main diagonal, accommodates elements A139271 in odd places,
diagonal 3, located above the main diagonal, is alternation of elements A033566 and A194431.

			The start of the sequence as a table:
   1   4   2   9   7   8  16 ...
   5   3  10   8  19  17  32 ...
   6  13  11  22  20  35  33 ...
  14  12  23  21  36  34  53 ...
  15  26  24  39  37  56  54 ...
  27  25  40  38  57  55  78 ...
  28  43  41  60  58  81  79 ...
  ...
The start of the sequence as a triangle array read by rows:
   1
   4  5
   2  3  6
   9 10 13 14
   7  8 11 12 15
  18 19 22 23 26 27
  16 17 20 21 24 25 28
  ...
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  5  2  3  6
   9 10 13 14  7  8 11 12 15
  18 19 22 23 26 27 16 17 20 21 24 25 28
  ...
Row number r contains permutation 4*r-3 numbers from 2*r*r-5*r+4 to 2*r*r-r:
2*r*r-5*r+6, 2*r*r-5*r+7, ..., 2*r*r-r-4, 2*r*r-r-3, 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. A000384, A002260, A003056, A003057, A004736, A014106, A033566, A033567, A033585, A033816, A071355, A091823, A100037, A130861, A130883, A139271, A188135, A194431, A211377.

T:=(n,k)->((k+n)^2-4*k+3-(-1)^n-(k+n)*(-1)^(k+n))/2: seq(seq(T(k,n-k),k=1..n-1),n=1..13); # Muniru A Asiru, Dec 06 2018

T[n_, k_] := ((n+k)^2 - 4k + 3 - (-1)^n - (-1)^(n+k)(n+k))/2;
Table[T[n-k+1, k], {n, 1, 12}, {k, n, 1, -1}] // Flatten (* Jean-François Alcover, Dec 06 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=((t+2)**2-4*j+3-(-1)**i-(t+2)*(-1)**t)/2

As a table:
T(n,k) = ((k+n)^2-4*k+3-(-1)^n-(k+n)*(-1)^(k+n))/2.
As a linear sequence:
a(n) = (A003057(n)^2-4*A004736(n)+3-(-1)^A002260(n)-A003057(n)*(-1)^A003056(n))/2;
a(n) = ((t+2)^2-4*j+3-(-1)^i-(t+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).

cp's OEIS Frontend

A154105 a(n) = 12*n^2 + 18*n + 7.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A286785 Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maxima

PARI

Formula

A317304 Numbers k with the property that both Dyck paths of the symmetric representation of sigma(k) have a central valley.

Views

Author

Keywords

Comments

Examples

Crossrefs

A139580 a(n) = n*(2*n + 17).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A139581 a(n) = n*(2*n + 19).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A156140 Accumulation of Stern's diatomic series: a(0)=-1, a(1)=0, and a(n+1) = (2e(n)+1)*a(n) - a(n-1) for n > 1, where e(n) is the highest power of 2 dividing n.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

R

Formula

A161983 Irregular triangle read by rows: the group of 2n + 1 integers starting at A014105(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula

Extensions

A185871 (Even,even)-polka dot array in the natural number array A000027, by antidiagonals.

Views

A154105 a(n) = 12n^2 + 18n + 7.

A139580 a(n) = n(2n + 17).

A139581 a(n) = n(2n + 19).

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

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