A187710 -id:A187710 - cp's OEIS frontend

A167499 a(n) = n*(n+3)/2 + 6.

6, 8, 11, 15, 20, 26, 33, 41, 50, 60, 71, 83, 96, 110, 125, 141, 158, 176, 195, 215, 236, 258, 281, 305, 330, 356, 383, 411, 440, 470, 501, 533, 566, 600, 635, 671, 708, 746, 785, 825, 866, 908, 951, 995, 1040, 1086, 1133, 1181, 1230, 1280, 1331, 1383, 1436, 1490

Offset: 0

Vincenzo Librandi, Nov 07 2009

Numbers m > 5 such that 8*m - 39 is a square. - Bruce J. Nicholson, Jul 25 2017

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Ângela Mestre and José Agapito, Square Matrices Generated by Sequences of Riordan Arrays, Journal of Integer Sequences, Vol. 22 (2019), Article 19.8.4.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A187710.

[n*(n+3)/2+6: n in [0..60]]; // Vincenzo Librandi, Sep 16 2013

A167499:=n->n*(n+3)/2+6: seq(A167499(n), n=0..100); # Wesley Ivan Hurt, Jul 25 2017

Table[n*(n + 3)/2 + 6, {n, 0, 100}] (* Vladimir Joseph Stephan Orlovsky, Jun 03 2011 *)
CoefficientList[Series[(6 - 10 x + 5 x^2) / (1 - x)^3, {x, 0, 60}], x] (* Vincenzo Librandi, Sep 16 2013 *)
LinearRecurrence[{3,-3,1},{6,8,11},60] (* Harvey P. Dale, Jun 21 2022 *)

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

a(n) = n + a(n-1) + 1, with n > 1, a(1) = 8.
From Vincenzo Librandi, Sep 16 2013: (Start)
G.f.: (6 - 10*x + 5*x^2)/(1-x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). (End)
Sum_{n>=0} 1/a(n) = 2*Pi*tanh(Pi*sqrt(39)/2)/sqrt(39) - 1/5. - Amiram Eldar, Jan 17 2021
From Elmo R. Oliveira, Oct 31 2024: (Start)
E.g.f.: exp(x)*(6 + 2*x + x^2/2).
a(n) = A187710(n+1)/2. (End)

A214870 Natural numbers placed in table T(n,k) layer by layer. The order of placement: at the beginning filled odd places of layer clockwise, next - even places counterclockwise. T(n,k) read by antidiagonals.

Original entry on oeis.org

1, 2, 3, 5, 4, 7, 10, 9, 8, 13, 17, 16, 6, 14, 21, 26, 25, 11, 12, 22, 31, 37, 36, 18, 15, 20, 32, 43, 50, 49, 27, 24, 23, 30, 44, 57, 65, 64, 38, 35, 19, 33, 42, 58, 73, 82, 81, 51, 48, 28, 29, 45, 56, 74, 91, 101, 100, 66, 63, 39, 34, 41, 59, 72, 92, 111

Offset: 1

Boris Putievskiy, Mar 11 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.
Layer is pair of sides of square from T(1,n) to T(n,n) and from T(n,n) to T(n,1).
Enumeration table T(n,k) layer by layer. The order of the list:
  T(1,1)=1;
  T(1,2), T(2,1), T(2,2);
  . . .
  T(1,n), T(3,n), ... T(n,3), T(n,1); T(n,2), T(n,4), ... T(4,n), T(2,n);
  . . .

			The start of the sequence as table:
   1   2   5  10  17  26 ...
   3   4   9  16  25  36 ...
   7   8   6  11  18  27 ...
  13  14  12  15  24  35 ...
  21  22  20  23  19  28 ...
  31  32  30  33  29  34 ...
  ...
The start of the sequence as triangle array read by rows:
   1;
   2,  3;
   5,  4,  7;
  10,  9,  8, 13;
  17, 16,  6, 14, 21;
  26, 25, 11, 12, 22, 31;
  ...

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. A060734, A060736, A185725, A213921, A213922; table T(n,k) contains: in rows A002522, A000290, A059100, A005563, A117950, A008865, A087475, A028872, A117951, A028347, A114949, A028875, A117619, A028878, A189833, A028881, A189834, A028884, A114948, A028560, A189836; in columns A002061, A014206, A002378, A027688, A028387, A027689, A028552, A027690, A014209, A027691, A027692, A082111, A027693, A028557, A027694, A108195, A187710, A048058, A048840.

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

As table
T(n,k) = k*k-2*(n mod 2)*k+(n mod 2)*((n+1)/2+1)+((n+1) mod 2)*(-n/2+1), if n<=k;
T(n,k) = n*n-n+(k mod 2)*(2-(k+1)/2)+((k+1) mod 2)*(k/2+1), if n>k.
As linear sequence
a(n) = j*j-2*(i mod 2)*j+(i mod 2)*((i+1)/2+1)+((i+1) mod 2)*(-i/2+1), if i<=j;
a(n) = i*i-i+(j mod 2)*(2-(j+1)/2)+((j+1) mod 2)*(j/2+1), if i>j; 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

A167499 a(n) = n*(n+3)/2 + 6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula