A028347 -id:A028347 - cp's OEIS frontend

A067727 a(n) = 7n^2 + 14n.

21, 56, 105, 168, 245, 336, 441, 560, 693, 840, 1001, 1176, 1365, 1568, 1785, 2016, 2261, 2520, 2793, 3080, 3381, 3696, 4025, 4368, 4725, 5096, 5481, 5880, 6293, 6720, 7161, 7616, 8085, 8568, 9065, 9576, 10101, 10640, 11193, 11760, 12341, 12936

Offset: 1

Robert G. Wilson v, Feb 05 2002

Positive numbers k such that 7*(7 + k) is a perfect square.

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

Cf. A186029.

Cf. numbers k such that k*(k + m) is a perfect square: A028560 (k=9), A067728 (k=8), A067726 (k=6), A067724 (k=5), A028347 (k=4), A067725 (k=3), A054000 (k=2), A005563 (k=1).

List([1..45], n-> 7*n*(n+2)); # G. C. Greubel, Sep 01 2019

[7*n*(n+2): n in [1..50]]; // Vincenzo Librandi, Jul 08 2012

seq(7*n*(n+2), n=1..45); # G. C. Greubel, Sep 01 2019

Select[ Range[15000], IntegerQ[ Sqrt[ 7(7 + # )]] & ]
CoefficientList[Series[7*(3-x)/(1-x)^3,{x,0,50}],x] (* Vincenzo Librandi, Jul 08 2012 *)
7*(Range[2,45]^2 -1) (* G. C. Greubel, Sep 01 2019 *)
LinearRecurrence[{3,-3,1},{21,56,105},50] (* Harvey P. Dale, Dec 07 2022 *)

a(n)= 7*n*(n+2) \\ Charles R Greathouse IV, Dec 07 2011

[7*n*(n+2) for n in (1..45)] # G. C. Greubel, Sep 01 2019

a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Vincenzo Librandi, Jul 08 2012
G.f.: 7*x*(3-x)/(1-x)^3. - Vincenzo Librandi, Jul 08 2012
E.g.f.: 7*x*(3 + x)*exp(x). - G. C. Greubel, Sep 01 2019
From Amiram Eldar, Feb 25 2022: (Start)
Sum_{n>=1} 1/a(n) = 3/28.
Sum_{n>=1} (-1)^(n+1)/a(n) = 1/28. (End)

Edited by Charles R Greathouse IV, Jul 25 2010

A100345 Triangle read by rows: T(n,k) = n*(n+k), 0 <= k <= n.

Original entry on oeis.org

0, 1, 2, 4, 6, 8, 9, 12, 15, 18, 16, 20, 24, 28, 32, 25, 30, 35, 40, 45, 50, 36, 42, 48, 54, 60, 66, 72, 49, 56, 63, 70, 77, 84, 91, 98, 64, 72, 80, 88, 96, 104, 112, 120, 128, 81, 90, 99, 108, 117, 126, 135, 144, 153, 162, 100, 110, 120, 130, 140, 150, 160, 170, 180, 190

Offset: 0

Reinhard Zumkeller, Nov 18 2004

Distinct members (except 0) are in A071562. Numbers occurring at least twice are in A175040. - Franklin T. Adams-Watters, Apr 04 2010

			Triangle begins:
   0
   1   2
   4   6   8
   9  12  15  18
  16  20  24  28  32
  25  30  35  40  45  50
  36  42  48  54  60  66  72
  49  56  63  70  77  84  91  98
  64  72  80  88  96 104 112 120 128

Cf. A000290, A000384, A001105, A002378, A005563, A014107, A028347, A028552, A028557, A028560, A028563, A028566, A028569, A046092, A054000, A071355, A071562, A085789, A098603, A175040.

Table[n(n+k),{n,0,10},{k,0,n}]//Flatten (* Harvey P. Dale, Aug 16 2018 *)

row(n) = vector(n+1, k, n*(n+k-1)); \\ Amiram Eldar, May 09 2025

T(n,0) = A000290(n).
T(n,1) = A002378(n) for n > 0.
T(n,2) = A005563(n) for n > 1.
T(n,3) = A028552(n) for n > 2.
T(n,4) = A028347(n+2) for n > 3.
T(n,5) = A028557(n) for n > 4.
T(n,6) = A028560(n) for n > 5.
T(n,7) = A028563(n) for n > 6.
T(n,8) = A028566(n) for n > 7.
T(n,9) = A028569(n) for n > 8.
T(n,10) = A098603(n) for n > 9.
T(n,n-5) = A071355(n-4) for n > 4.
T(n,n-4) = A054000(n-1) for n > 3.
T(n,n-3) = A014107(n) for n > 2.
T(n,n-2) = A046092(n-1) for n > 1.
T(n,n-1) = A000384(n) for n > 0.
T(n,n) = A001105(n).
Row sums give A085789 for n > 0.
G.f.: x*(1 + 2*y + 6*x^3*y^2 - 3*x^2*y*(1 + 2*y) + x*(1 - 3*y + 2*y^2))/((1 - x)^3*(1 - x*y)^3). - Stefano Spezia, Jul 03 2025

A067724 a(n) = 5n^2 + 10n.

Original entry on oeis.org

15, 40, 75, 120, 175, 240, 315, 400, 495, 600, 715, 840, 975, 1120, 1275, 1440, 1615, 1800, 1995, 2200, 2415, 2640, 2875, 3120, 3375, 3640, 3915, 4200, 4495, 4800, 5115, 5440, 5775, 6120, 6475, 6840, 7215, 7600, 7995, 8400, 8815, 9240, 9675

Offset: 1

Robert G. Wilson v, Feb 05 2002

Positive numbers m such that 5*(5 + m) is a perfect square.

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

Cf. numbers k such that k*(k + m) is a perfect square: A028560 (k=9), A067728 (k=8), A067727 (k=7), A067726 (k=6), A028347 (k=4), A067725 (k=3), A054000 (k=2), A067998 (k=1).

Cf. A055998.

[5*n*(n+2): n in [1..50]]; // Vincenzo Librandi, Jul 08 2012

Select[Range[10000], IntegerQ[ Sqrt[5 (5 + # )]] &]
CoefficientList[Series[5 (3 - x)/(1 - x)^3, {x, 0, 40}], x] (* Vincenzo Librandi, Jul 08 2012 *)
Table[5n^2+10n,{n,60}] (* or *) LinearRecurrence[{3,-3,1},{15,40,75},60] (* Harvey P. Dale, May 22 2018 *)

a(n)=5*n*(n+2) \\ Charles R Greathouse IV, Dec 07 2011

From Vincenzo Librandi, Jul 08 2012: (Start)
G.f.: 5*x*(3 - x)/(1 - x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). (End)
a(n) = A055998(3*n) + A055998(n). - Bruno Berselli, Sep 23 2016
From Amiram Eldar, Feb 25 2022: (Start)
Sum_{n>=1} 1/a(n) = 3/20.
Sum_{n>=1} (-1)^(n+1)/a(n) = 1/20. (End)
E.g.f.: 5*exp(x)*x*(3 + x). - Stefano Spezia, Oct 01 2023

A067726 a(n) = 6n^2 + 12n.

Original entry on oeis.org

18, 48, 90, 144, 210, 288, 378, 480, 594, 720, 858, 1008, 1170, 1344, 1530, 1728, 1938, 2160, 2394, 2640, 2898, 3168, 3450, 3744, 4050, 4368, 4698, 5040, 5394, 5760, 6138, 6528, 6930, 7344, 7770, 8208, 8658, 9120, 9594, 10080, 10578, 11088, 11610

Offset: 1

Robert G. Wilson v, Feb 05 2002

Positive numbers k such that 6*(6 + k) is a perfect square.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Leo Tavares, Illustration: Star Cut Hexagons
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. numbers k such that k*(k + m) is a perfect square: A028560 (k=9), A067728 (k=8), A067727 (k=7), A067724 (k=5), A028347 (k=4), A067725 (k=3), A054000 (k=2), A005563 (k=1).

Cf. A003154, A003215.

List([1..45], n-> 6*n*(n+2)); # G. C. Greubel, Sep 01 2019

[6*n*(n+2): n in [1..50]]; // Vincenzo Librandi, Jul 08 2012

seq(6*n*(n+2), n=1..45); # G. C. Greubel, Sep 01 2019

Select[ Range[15000], IntegerQ[ Sqrt[ 6(6 + # )]] & ]
CoefficientList[Series[6*(3-x)/(1-x)^3,{x,0,50}],x] (* Vincenzo Librandi, Jul 08 2012 *)
6*(Range[2, 45]^2 -1) (* G. C. Greubel, Sep 01 2019 *)
LinearRecurrence[{3,-3,1},{18,48,90},60] (* Harvey P. Dale, May 10 2022 *)

a(n)=6*n*(n+2) \\ Charles R Greathouse IV, Dec 07 2011

[6*n*(n+2) for n in (1..45)] # G. C. Greubel, Sep 01 2019

G.f.: 6*x*(3 - x)/(1 - x)^3. - Vincenzo Librandi, Jul 08 2012
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Vincenzo Librandi, Jul 08 2012
E.g.f.: 6*x*(3 + x)*exp(x). - G. C. Greubel, Sep 01 2019
From Amiram Eldar, Feb 25 2022: (Start)
Sum_{n>=1} 1/a(n) = 1/8.
Sum_{n>=1} (-1)^(n+1)/a(n) = 1/24. (End)
a(n) = A003215(2*n) - A003154(n). - Leo Tavares, May 20 2023
a(n) = 6*A005563(n). - Hugo Pfoertner, May 24 2023

A080096 a(1) = a(2) = 1, a(3) = 2, thereafter a(n) = abs(a(n-1) - a(n-2) - a(n-3)).

Original entry on oeis.org

1, 1, 2, 0, 3, 1, 2, 2, 1, 3, 0, 4, 1, 3, 2, 2, 3, 1, 4, 0, 5, 1, 4, 2, 3, 3, 2, 4, 1, 5, 0, 6, 1, 5, 2, 4, 3, 3, 4, 2, 5, 1, 6, 0, 7, 1, 6, 2, 5, 3, 4, 4, 3, 5, 2, 6, 1, 7, 0, 8, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 6, 2, 7, 1, 8, 0, 9, 1, 8, 2, 7, 3, 6, 4, 5, 5, 4, 6, 3, 7, 2, 8, 1, 9, 0, 10, 1, 9, 2, 8, 3, 7, 4, 6, 5

Offset: 1

Benoit Cloitre, Jan 28 2003

nonn

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A028347, A028557, A077623, A077653, A079623, A079624, A088226.

a080096 n = a080096_list !! (n-1)
a080096_list = 1 : 1 : 2 : zipWith3 (\u v w -> abs (w - v - u))
               a080096_list (tail a080096_list) (drop 2 a080096_list)
-- Reinhard Zumkeller, Oct 11 2014

m:=120;
A080096:=[n le 3 select Floor((n+1)/2) else Abs(Self(n-1) - Self(n-2) - Self(n-3)): n in [1..m+5]];
[A080096[n]: n in [1..m]]; // G. C. Greubel, Sep 11 2024

nxt[{a_,b_,c_}]:={b,c,Abs[c-b-a]}; NestList[nxt,{1,1,2},110][[All,1]] (* Harvey P. Dale, Nov 14 2021 *)

a(n)=local(k,m); if(n<1,0,k=sqrtint(n+4); m=n+4-k^2; if(m%2,m\2+1,k-m\2))

@CachedFunction
def a(n): # a = A080096
    if n<4: return int((n+1)//2)
    else: return abs(a(n-1)-a(n-2)-a(n-3))
[a(n) for n in range(1,101)] # G. C. Greubel, Sep 11 2024

For n>=3 Max( a(k) : 1<=k<=n ) = floor ( sqrt(n+4)).
Special cases: a(n^2 + 4*n - 1) = 0 and a(n^2 - 4) = n.
a(A028557(n)) = a(A028557(n+1)).
Sum_{k=(n-1)^2 .. n^2} a(k) = n^2.

A098832 Square array read by antidiagonals: even-numbered rows of the table are of the form n(n+m) and odd-numbered rows are of the form n(n+m)/2.

Original entry on oeis.org

1, 3, 3, 6, 8, 2, 10, 15, 5, 5, 15, 24, 9, 12, 3, 21, 35, 14, 21, 7, 7, 28, 48, 20, 32, 12, 16, 4, 36, 63, 27, 45, 18, 27, 9, 9, 45, 80, 35, 60, 25, 40, 15, 20, 5, 55, 99, 44, 77, 33, 55, 22, 33, 11, 11, 66, 120, 54, 96, 42, 72, 30, 48, 18, 24, 6, 78, 143, 65, 117, 52, 91, 39, 65, 26, 39, 13, 13

Offset: 1

Eugene McDonnell (eemcd(AT)mac.com), Nov 02 2004

The rows of this table and that in A098737 are related. Given a function f = n/( 1 + (1+n) mod(2) ), row n of A098737 can be derived from row n of T by multiplying the latter by f(n); row n of T can be derived from row n of A098737 by dividing the latter by f(n).

			Array begins as:
  1,  3,  6, 10, 15, 21,  28,  36,  45 ... A000217;
  3,  8, 15, 24, 35, 48,  63,  80,  99 ... A005563;
  2,  5,  9, 14, 20, 27,  35,  44,  54 ... A000096;
  5, 12, 21, 32, 45, 60,  77,  96, 117 ... A028347;
  3,  7, 12, 18, 25, 33,  42,  52,  63 ... A027379;
  7, 16, 27, 40, 55, 72,  91, 112, 135 ... A028560;
  4,  9, 15, 22, 30, 39,  49,  60,  72 ... A055999;
  9, 20, 33, 48, 65, 84, 105, 128, 153 ... A028566;
  5, 11, 18, 26, 35, 45,  56,  68,  81 ... A056000;
Antidiagonals begin as:
   1;
   3,  3;
   6,  8,  2;
  10, 15,  5,  5;
  15, 24,  9, 12,  3;
  21, 35, 14, 21,  7,  7;
  28, 48, 20, 32, 12, 16,  4;
  36, 63, 27, 45, 18, 27,  9,  9;
  45, 80, 35, 60, 25, 40, 15, 20,  5;
  55, 99, 44, 77, 33, 55, 22, 33, 11, 11;

G. C. Greubel, Antidiagonals n = 1..50, flattened

Row m of array: A000217 (m=1), A005563 (m=2), A000096 (m=3), A028347 (m=4), A027379 (m=5), A028560 (m=6), A055999 (m=7), A028566 (m=8), A056000 (m=9), A098603 (m=10), A056115 (m=11), A098847 (m=12), A056119 (m=13), A098848 (m=14), A056121 (m=15), A098849 (m=16), A056126 (m=17), A098850 (m=18), A051942 (m=19).
Column m of array: A026741 (m=1), A022998 (m=2), A165351 (m=3).
Cf. A098737, A168509, A181900.

A098832:= func< n,k | (1/4)*(3+(-1)^k)*(n+1)*(n-k+1) >;
[A098832(n,k): k in [1..n], n in [1..15]]; // G. C. Greubel, Jul 31 2022

A098832[n_, k_]:= (1/4)*(3+(-1)^k)*(n+1)*(n-k+1);
Table[A098832[n,k], {n,15}, {k,n}]//Flatten (* G. C. Greubel, Jul 31 2022 *)

def A098832(n,k): return (1/4)*(3+(-1)^k)*(n+1)*(n-k+1)
flatten([[A098832(n,k) for k in (1..n)] for n in (1..15)]) # G. C. Greubel, Jul 31 2022

Item m of row n of T is given (in infix form) by: n T m = n * (n + m) / (1 + m (mod 2)). E.g. Item 4 of row 3 of T: 3 T 4 = 14.
From G. C. Greubel, Jul 31 2022: (Start)
A(n, k) = (1/4)*(3 + (-1)^n)*k*(k+n) (array).
T(n, k) = (1/4)*(3 + (-1)^k)*(n+1)*(n-k+1) (antidiagonal triangle).
Sum_{k=1..n} T(n, k) = (1/8)*(n+1)*( (3*n-1)*(n+1) + (1+(-1)^n)/2 ).
T(2*n-1, n) = A181900(n).
T(2*n+1, n) = 2*A168509(n+1). (End)

Missing terms added by G. C. Greubel, Jul 31 2022

A132768 a(n) = n*(n + 26).

Original entry on oeis.org

0, 27, 56, 87, 120, 155, 192, 231, 272, 315, 360, 407, 456, 507, 560, 615, 672, 731, 792, 855, 920, 987, 1056, 1127, 1200, 1275, 1352, 1431, 1512, 1595, 1680, 1767, 1856, 1947, 2040, 2135, 2232, 2331, 2432, 2535, 2640, 2747, 2856, 2967, 3080, 3195, 3312, 3431

Offset: 0

Omar E. Pol, Aug 28 2007

G. C. Greubel, Table of n, a(n) for n = 0..5000
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. A098849, A098850, A098603, A098847, A098848, A102928, A120071, A132759, A132760, A132761.
Cf. A132762, A132763, A132764, A132765, A132766, A132767.

Table[n(n+26),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,27,56},50] (* Harvey P. Dale, Dec 15 2018 *)

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

[n*(n+26) for n in (0..50)] # G. C. Greubel, Mar 13 2022

a(n) = n*(n + 26).
a(n) = 2*n + a(n-1) + 25, with a(0)=0. - Vincenzo Librandi, Aug 03 2010
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(26)/26 = A001008(26)/A102928(26) = 34395742267/232016584800, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 18051406831/696049754400. (End)
From G. C. Greubel, Mar 13 2022: (Start)
G.f.: x*(27 - 25*x)/(1-x)^3.
E.g.f.: x*(27 + x)*exp(x). (End)

A132769 a(n) = n*(n + 27).

Original entry on oeis.org

0, 28, 58, 90, 124, 160, 198, 238, 280, 324, 370, 418, 468, 520, 574, 630, 688, 748, 810, 874, 940, 1008, 1078, 1150, 1224, 1300, 1378, 1458, 1540, 1624, 1710, 1798, 1888, 1980, 2074, 2170, 2268, 2368, 2470, 2574, 2680, 2788, 2898, 3010, 3124, 3240, 3358, 3478

Offset: 0

Omar E. Pol, Aug 28 2007

Harvey P. Dale, Table of n, a(n) for n = 0..1000
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.
Cf. A028569, A098849, A098850, A098603, A098847, A098848, A102928, A120071, A132759.
Cf. A132760, A132761, A132762, A132763, A132764, A132765, A132766, A132767, A132768.
Cf. A132756.

Table[n(n+27),{n,0,50}] (* or *) LinearRecurrence[{3,-3,1},{0,28,58},50] (* Harvey P. Dale, Oct 14 2012 *)

a(n)=n*(n+27) \\ Charles R Greathouse IV, Oct 07 2015

a(n) = 2*n + a(n-1) + 26, with a(0)=0. - Vincenzo Librandi, Aug 03 2010
a(0)=0, a(1)=28, a(2)=58; for n > 2, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Oct 14 2012
From Amiram Eldar, Jan 16 2021: (Start)
Sum_{n>=1} 1/a(n) = H(27)/27 = A001008(27)/A102928(27) = 312536252003/2168462696400, where H(k) is the k-th harmonic number.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2)/27 - 57128792093/2168462696400. (End)
From Elmo R. Oliveira, Nov 29 2024: (Start)
G.f.: 2*x*(14 - 13*x)/(1 - x)^3.
E.g.f.: exp(x)*x*(28 + x).
a(n) = 2*A132756(n). (End)

A105020 Array read by antidiagonals: row n (n >= 0) contains the numbers m^2 - n^2, m >= n+1.

Original entry on oeis.org

1, 3, 4, 5, 8, 9, 7, 12, 15, 16, 9, 16, 21, 24, 25, 11, 20, 27, 32, 35, 36, 13, 24, 33, 40, 45, 48, 49, 15, 28, 39, 48, 55, 60, 63, 64, 17, 32, 45, 56, 65, 72, 77, 80, 81, 19, 36, 51, 64, 75, 84, 91, 96, 99, 100, 21, 40, 57, 72, 85, 96, 105, 112, 117, 120, 121

Offset: 0

Andrew S. Plewe and Franklin T. Adams-Watters, Jul 11 2005

A "Goldbach Conjecture" for this sequence: when there are n terms between consecutive odd integers (2n+1) and (2n+3) for n > 0, at least one will be the product of 2 primes (not necessarily distinct). Example: n=3 for consecutive odd integers a(7)=7 and a(11)=9 and of the 3 sequence entries a(8)=12, a(9)=15 and a(10)=16 between them, one is the product of 2 primes a(9)=15=3*5. - Michael Hiebl, Jul 15 2007
A024352 gives distinct values in the array, minus the first row (1, 4, 9, 16, etc.). a(n) gives all solutions to the equation x^2 + xy = n, with y mod 2 = 0, x > 0, y >= 0. - Andrew S. Plewe, Oct 19 2007
Alternatively, triangular sequence of coefficients of Dynkin diagram weights for the Cartan groups C_n: t(n,m) = m*(2*n - m). Row sums are A002412. - Roger L. Bagula, Aug 05 2008

			Array begins:
  1  4  9 16 25 36  49  64  81 100 ...
  3  8 15 24 35 48  63  80  99 120 ...
  5 12 21 32 45 60  77  96 117 140 ...
  7 16 27 40 55 72  91 112 135 160 ...
  9 20 33 48 65 84 105 128 153 180 ...
  ...
Triangle begins:
   1;
   3,  4;
   5,  8,  9;
   7, 12, 15, 16;
   9, 16, 21, 24, 25;
  11, 20, 27, 32, 35, 36;
  13, 24, 33, 40, 45, 48, 49;
  15, 28, 39, 48, 55, 60, 63, 64;
  17, 32, 45, 56, 65, 72, 77, 80, 81;
  19, 36, 51, 64, 75, 84, 91, 96, 99, 100;

R. N. Cahn, Semi-Simple Lie Algebras and Their Representations, Dover, NY, 2006, ISBN 0-486-44999-8, p. 139.

G. C. Greubel, Antidiagonals n = 0..50, flattened

Rows give A000290, A005563, A028347, A028560, A028566, A098603, A098847, A098848, A098849, A098850.
Columns give A005408, A008586, A016945, A008590, A017329, A008594, A008598, A008602, A008606, A000567.
Diagonals give A033428, A045944, A067725.
Cf. A000384, A002412, A024352, A105020, A128076.

[(k+1)*(2*n-k+1): k in [0..n], n in [0..15]]; // G. C. Greubel, Mar 15 2023

t[n_, m_]:= (n^2 - m^2); Flatten[Table[t[i, j], {i,12}, {j,i-1,0,-1}]]
(* to view table *) Table[t[i, j], {j,0,6}, {i,j+1,10}]//TableForm (* Robert G. Wilson v, Jul 11 2005 *)
Table[(k+1)*(2*n-k+1), {n,0,15}, {k,0,n}]//Flatten (* Roger L. Bagula, Aug 05 2008 *)

def A105020(n,k): return (k+1)*(2*n-k+1)
flatten([[A105020(n,k) for k in range(n+1)] for n in range(16)]) # G. C. Greubel, Mar 15 2023

a(n) = r^2 - (r^2 + r - m)^2/4, where r = round(sqrt(m)) and m = 2*n+2. - Wesley Ivan Hurt, Sep 04 2021
a(n) = A128076(n+1) * A105020(n+1). - Wesley Ivan Hurt, Jan 07 2022
From G. C. Greubel, Mar 15 2023: (Start)
Sum_{k=0..n} T(n, k) = A002412(n+1).
Sum_{k=0..n} (-1)^k*T(n, k) = (1/2)*((1+(-1)^n)*A000384((n+2)/2) - (1- (-1)^n)*A000384((n+1)/2)). (End)

More terms from Robert G. Wilson v, Jul 11 2005

A020735 Odd numbers >= 5.

Original entry on oeis.org

5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131

Offset: 1

David W. Wilson

Values of n such that a regular polygon with n sides can be formed by tying knots in a strip of paper. - Robert A. J. Matthews (rajm(AT)compuserve.com)
These polygons fill in many of the gaps left by the Greeks, who were restricted to compass and ruler. Specifically, they make possible construction of the regular 7-sided heptagon, 9-sided nonagon, 11-gon and 13-gon. The 14-gon becomes the first to be impossible by either ruler, compass or knotting.
Continued fraction expansion of 2/(exp(2)-7). - Thomas Baruchel, Nov 04 2003
Pisot sequence T(5,7). - David W. Wilson
Sun conjectures that any member of this sequence is of the form m^2 + m + p, where p is prime. Blanco-Chacon, McGuire, & Robinson prove that the primes of this form have density 1. - Charles R Greathouse IV, Jun 20 2019

F. V. Morley, Proceedings of the London Mathematical Society, Jun 1923.
F. V. Morley, "Inversive Geometry" (George Bell, 1933; reprinted Chelsea Publishing Co. 1954).

Ivan Blanco-Chacon, Gary McGuire, and Oisin Robinson, Primes of the form n^2+n+p have density 1, arXiv:1707.06014 [math.NT], 2017.
Tanya Khovanova, Recursive Sequences.
Zhi-Wei Sun, On sums of primes and triangular numbers, arXiv:0803.3737 [math.NT], 2008-2009; Journal of Combinatorics and Number Theory 1:1 (2009), pp. 65-76.
Index entries for sequences related to knots.
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Subsequence of A005408. See A008776 for definitions of Pisot sequences.

Cf. A016825, A028347.

Range[5,131,2] (* Harvey P. Dale, Aug 11 2012 *)

a(n)=2*n+3 \\ Charles R Greathouse IV, Jul 10 2016

a(n) = 2*n + 3.
From Colin Barker, Jan 31 2012: (Start)
G.f.: x*(5-3*x)/(1-2*x+x^2).
a(n) = 2*a(n-1) - a(n-2). (End)
From Elmo R. Oliveira, Oct 31 2024: (Start)
E.g.f.: exp(x)*(2*x + 3) - 3.
a(n) = A016825(n+1)/2 = A028347(n+2) - A028347(n+1). (End)

Entry revised by N. J. A. Sloane, Jan 26 2007

cp's OEIS Frontend

A067727 a(n) = 7*n^2 + 14*n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A100345 Triangle read by rows: T(n,k) = n*(n+k), 0 <= k <= n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

A067724 a(n) = 5*n^2 + 10*n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A067726 a(n) = 6*n^2 + 12*n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A080096 a(1) = a(2) = 1, a(3) = 2, thereafter a(n) = abs(a(n-1) - a(n-2) - a(n-3)).

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

SageMath

Formula

A098832 Square array read by antidiagonals: even-numbered rows of the table are of the form n*(n+m) and odd-numbered rows are of the form n*(n+m)/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

A067727 a(n) = 7n^2 + 14n.

A067724 a(n) = 5n^2 + 10n.

A067726 a(n) = 6n^2 + 12n.

A098832 Square array read by antidiagonals: even-numbered rows of the table are of the form n(n+m) and odd-numbered rows are of the form n(n+m)/2.