A028557 -id:A028557 - cp's OEIS frontend

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

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)

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).

A277108 a(n) = 4n(n+5).

Original entry on oeis.org

24, 56, 96, 144, 200, 264, 336, 416, 504, 600, 704, 816, 936, 1064, 1200, 1344, 1496, 1656, 1824, 2000, 2184, 2376, 2576, 2784, 3000, 3224, 3456, 3696, 3944, 4200, 4464, 4736, 5016, 5304, 5600, 5904, 6216, 6536, 6864, 7200, 7544, 7896, 8256, 8624, 9000, 9384, 9776

Offset: 1

Emeric Deutsch, Nov 05 2016

a(n) is the second Zagreb index of the helm graph H[n] (n>=3).
The second Zagreb index of a simple connected graph g is the sum of the degree products d(i)d(j) over all edges ij of g.
The M-polynomial of the Helm graph H[n] is M(H[n]; x,y) = n*x*y^4 + n*x^4*y^4 + n*x^4*y^n. - Emeric Deutsch, May 11 2018
The helm graph H[n] is the  graph obtained from an n-wheel graph by adjoining a pendant edge at each node of the cycle. - Emeric Deutsch, May 11 2018
a(n) - 16*n + 1 is a square. - Muniru A Asiru, Jun 01 2018

Muniru A Asiru, Table of n, a(n) for n = 1..5000
Emeric Deutsch and Sandi Klavzar, M-polynomial and degree-based topological indices, Iranian J. Math. Chemistry, Vol. 6, No. 2, 2015, pp. 93-102.
Eric Weisstein's World of Mathematics, Helm Graph.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A028557, A055998, A132761.

List([1..50],n->4*n*(n+5)); # Muniru A Asiru, Jun 01 2018

Maple
```
seq(4*n^2+20*n, n = 1 .. 40);
```

Table[4 n (n + 5), {n, 40}] (* or *)
Rest@ CoefficientList[Series[8 x (3 - 2 x)/(1 - x)^3, {x, 0, 40}], x] (* Michael De Vlieger, Nov 06 2016 *)

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

G.f.: 8*z*(3-2*z)/(1-z)^3.
a(n) = 4*A028557(n) = 8*A055998(n).
From Elmo R. Oliveira, Jan 28 2025: (Start)
E.g.f.: 4*exp(x)*x*(6 + x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 3. (End)

A343125 Triangle T(k, n) = (n+3)*(k-n) - 4, k >= 2, 1 <= n <= k-1, read by rows.

Original entry on oeis.org

0, 4, 1, 8, 6, 2, 12, 11, 8, 3, 16, 16, 14, 10, 4, 20, 21, 20, 17, 12, 5, 24, 26, 26, 24, 20, 14, 6, 28, 31, 32, 31, 28, 23, 16, 7, 32, 36, 38, 38, 36, 32, 26, 18, 8, 36, 41, 44, 45, 44, 41, 36, 29, 20, 9, 40, 46, 50, 52, 52, 50, 46, 40, 32, 22, 10

Offset: 2

Russell Jay Hendel, Apr 06 2021

T(k, n) is even if k is odd.
T(k, n) = T(k, n+1) for n = k/2 - 2 if k >= 6 is even.
T(k, n) = T(k, n+2) for n = (k-1)/2 - 2 if k >= 7 is odd.
For fixed n, T(k, n) is linear in k.
The T(k, j) contribute coefficients to a closed formula for the sum of the first n+1 squares of the k-generalized Fibonacci numbers, F(k, j) = A092921(k, j). See A343138 for sums of squares of F(k, j). See the Formula section for closed formula. Although other sequences occur in coefficients in the closed formula for sums of squares, they are linear in nature. All coefficient sequences are mentioned in the arXiv link. The closed formula generalizes results of Schumacher (see References) for the cases k=3 and k=4 with a uniform proof method (see arXiv link).

			Triangle T(k, n) begins:
   k \ n|  1  2  3  4  5  6  7  8  9  10 11
  ------+----------------------------------
   2    |  0
   3    |  4  1
   4    |  8  6  2
   5    | 12 11  8  3
   6    | 16 16 14 10  4
   7    | 20 21 20 17 12  5
   8    | 24 26 26 24 20 14  6
   9    | 28 31 32 31 28 23 16  7
  10    | 32 36 38 38 36 32 26 18  8
  11    | 36 41 44 45 44 41 36 29 20  9
  12    | 40 46 50 52 52 50 46 40 32 22 10
.
The following are the closed formulas for k = 3, 4 for A(k, n) = Sum_{m=0..n} F(k, m)^2, with F(k, n) = A092921(k, n), the k-generalized Fibonacci numbers, and A(k, n) = A343138(k, n), the sum of squares of F(k, n). These formulas are derived from the closed formula in the formula section. Of course further simplifications are possible. For k = 2, T(2, 1) = 0 so illustrations start with k = 3.
k | Formula
--+--------------------------------------------------------
3 | Sum_{m=0..n} F(3,m)^2 = (1/4)*(2*F(3,n)*F(3,n+2) + 4*F(3,n+1)*F(3,n+2) - (k - 2)*F(3,n)^2 - T(3,1)*F(3,n+1)^2 - T(3,2)*F(3,n+2)^2 + 1).
4 | Sum_{m=0..n} F(3,m)^2 = (1/6)*(-2*F(4,n)*F(4,n+1) + 2*F(4,n)*F(4,n+3) + 4*F(4,n+1)*F(4,n+3) + 6*F(4,n+2)*F(4,n+3) - (k-2)*F(4,n)^2 - T(4,1)*F(4,n+1)^2 - T(4, 2)*F(4,n+2)^2 - T(4,3)*F(4,n+3)^2 + 2).

Raphael Schumacher, How to Sum the Squares of the Tetranacci Numbers and the Fibonacci m-step Numbers, Fibonacci Quarterly, 57, (2019), 168-175.
Raphael Schumacher, Explicit Formulas for Sums Involving the Squares of the First n Tribonacci Numbers, Fibonacci Quarterly, 58 (2020), 194-202.

Russell Jay Hendel, Sums of Squares: Methods for Proving Identity Families, arXiv:2103.16756 [math.NT], 2021.
Proof Wiki, Sum of Sequence of Squares of Fibonacci Numbers

Cf. A028557, A085697, A092921, A140672, A343138.

T := (k, n) -> (n + 3)*(k - n) - 4:
seq(print(seq(T(k, n), n=1..k-1)), k = 2..12); # Peter Luschny, Apr 02 2021

Table[(n + 3) (k - n) - 4, {k, 2, 12}, {n, k - 1}] // Flatten (* Michael De Vlieger, Apr 06 2021 *)

T(k,n)=(n + 3)*(k - n) - 4
for(k = 2,12,for(n = 1,k - 1, print1(T(k,n),", ")))

flatten([[(n+3)*(k-n) -4 for n in (1..k-1)] for k in (2..15)]) # G. C. Greubel, Nov 22 2021

Let F(k, n) = A092921(k, n), the k-generalized Fibonacci numbers. Let A(k, n) = A343138(k, n) = Sum_{m=0..n} F(k, m)^2, the sum of the first m+1 k-generalized Fibonacci numbers. Then, for k >= 2, a closed formula for A(k, n) is:
A(k, n) = (1/(2*k-2)) * (Sum_{j=0..k-2, m=j+1..k-1} 2*(j+1)*(m-k+1) * F(k, n+j) * F(k, n+m)) - (k-2)*F(k, n)^2 - Sum_{j=1..k}(T(k, j) * F(k, n+j)^2) + (k-2)).
From G. C. Greubel, Nov 22 2021: (Start)
T(2*n-2, n) = A028557(n-2), n >= 2.
T(4*n-6, n) = 2*A140672(n-2), n >= 2. (End)

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

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.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

Formula

A277108 a(n) = 4*n*(n+5).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Maple

Mathematica

PARI

Formula

A343125 Triangle T(k, n) = (n+3)*(k-n) - 4, k >= 2, 1 <= n <= k-1, read by rows.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Formula

A277108 a(n) = 4n(n+5).