A154260 -id:A154260 - cp's OEIS frontend

A057570 Numbers of the form n*(7n+-1)/2.

0, 3, 4, 13, 15, 30, 33, 54, 58, 85, 90, 123, 129, 168, 175, 220, 228, 279, 288, 345, 355, 418, 429, 498, 510, 585, 598, 679, 693, 780, 795, 888, 904, 1003, 1020, 1125, 1143, 1254, 1273, 1390, 1410, 1533, 1554, 1683, 1705, 1840, 1863, 2004

Offset: 1

N. J. A. Sloane, Oct 04 2000

Also integers of the form Sum_{k = 1..n} k/7. - Alonso del Arte, Jan 20 2012
Sequence provides all integers m such that 56*m + 1 is a square. [Bruno Berselli, Oct 07 2015]
The sequence terms occur as the exponents in the expansion of Product_{n >= 1} (1 - x^(7*n)) * (1 + x^(7*n-3)) * (1 + x^(7*n-4)) = 1 + x^3 + x^4 + x^13 + x^15 + x^30 + x^33 + .... Cf. A363801. - Peter Bala, Nov 21 2024

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

Cf. A074378, A001318, A057569, A154260, A154292, A154293, A047341, A274830, A363801.

Select[Table[Plus@@Range[n]/7, {n, 0, 199}], IntegerQ] (* Alonso del Arte, Jan 20 2012 *)
CoefficientList[Series[-x (3 + x + 3 x^2) / ((1 + x)^2 (x - 1)^3), {x, 0, 40}], x] (* Vincenzo Librandi, Jun 19 2013 *)
LinearRecurrence[{1,2,-2,-1,1},{0,3,4,13,15},50] (* Harvey P. Dale, Sep 17 2023 *)

a(n)=(14*n*(n-1)+5*(2*n-1)*(-1)^n+5)/16 \\ Charles R Greathouse IV, Sep 24 2015

G.f.: -x^2*(3+x+3*x^2) / ( (1+x)^2*(x-1)^3 ). - R. J. Mathar, Jan 25 2011
a(n) = +1*a(n-1)+2*a(n-2)-2*a(n-3)-1*a(n-4)+1*a(n-5). - Joerg Arndt, Jan 25 2011
a(n) = (14*n*(n-1)+5*(2*n-1)*(-1)^n+5)/16. - Bruno Berselli, Jan 25 2011
a(n)-a(n-2) = A047341(n-1) for n>2. - Bruno Berselli, Jan 25 2011
Sum_{n>=2} 1/a(n) = 14 - 2*cot(Pi/7)*Pi. - Amiram Eldar, Mar 17 2022

A057569 Numbers of the form k(5k+1)/2 or k(5k-1)/2.

Original entry on oeis.org

0, 2, 3, 9, 11, 21, 24, 38, 42, 60, 65, 87, 93, 119, 126, 156, 164, 198, 207, 245, 255, 297, 308, 354, 366, 416, 429, 483, 497, 555, 570, 632, 648, 714, 731, 801, 819, 893, 912, 990, 1010, 1092, 1113, 1199, 1221, 1311, 1334, 1428, 1452, 1550

Offset: 1

N. J. A. Sloane, Oct 04 2000

a(n) is the set of all m such that 40*m+1 is a perfect square. - Gary Detlefs, Feb 22 2010
Integers of the form (n^2 - n) / 10. Numbers of the form  n * (5*n - 1) / 2 where n is an integer. - Michael Somos, Jan 13 2012
Also integers of the form sum_{k=1..n} k/5. - Alonso del Arte, Jan 20 2012
These numbers appear in a theta function identity. See the Hardy-Wright reference, Theorem 356 on p. 284. See the G.f. of A113428. - Wolfdieter Lang, Oct 28 2016

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Fifth ed., Clarendon Press, Oxford, 2003, p. 284.

G. C. Greubel, Table of n, a(n) for n = 1..5000
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A074378, A001318, A057570, A154260. - Vladimir Joseph Stephan Orlovsky, Jan 06 2009

Cf. A001622, A113428.

[(10*(n^2-n)+12*(-1)^n*(n div 2))/16: n in [1..60]]; // Vincenzo Librandi, Oct 29 2016

Select[Table[Plus@@Range[n]/5, {n, 0, 199}], IntegerQ] (* Alonso del Arte, Jan 20 2012 *)
LinearRecurrence[{1,2,-2,-1,1},{0,2,3,9,11},50] (* Harvey P. Dale, Jul 05 2021 *)

{a(n) = (10 * (n^2 - n) + 12 * (-1)^n * (n\2)) / 16}; \\ Michael Somos, Jan 13 2012

Vec(x^2*(2*x^2+x+2) / ((1-x)^3*(1+x)^2) + O(x^60)) \\ Colin Barker, Jun 13 2017

A005475 UNION A005476. G.f.: x^2*(2x^2+x+2)/((1-x)^3*(1+x)^2). a(n) = A132356(n+1)/4. - R. J. Mathar, Apr 07 2008
a(n) = (A090771(n)^2 -1)/40. - Gary Detlefs, Feb 22 2010
|A113428(n)| is the characteristic function of the numbers a(n).
a(n) = a(1 - n) for all n in Z. - Michael Somos, Jan 13 2012
From Colin Barker, Jun 13 2017: (Start)
a(n) = n*(5*n - 2)/8 for n even.
a(n) = (5*n - 3)*(n - 1)/8 for n odd.
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5) for n>5.
(End)
From Amiram Eldar, Mar 17 2022: (Start)
Sum_{n>=2} 1/a(n) = 10 - 2*sqrt(1+2/sqrt(5))*Pi.
Sum_{n>=2} (-1)^n/a(n) = 2*sqrt(5)*log(phi) - 5*(2-log(5)), where phi is the golden ratio (A001622). (End)

A219191 Numbers of the form k(7k+1), where k = 0,-1,1,-2,2,-3,3,...

Original entry on oeis.org

0, 6, 8, 26, 30, 60, 66, 108, 116, 170, 180, 246, 258, 336, 350, 440, 456, 558, 576, 690, 710, 836, 858, 996, 1020, 1170, 1196, 1358, 1386, 1560, 1590, 1776, 1808, 2006, 2040, 2250, 2286, 2508, 2546, 2780, 2820, 3066, 3108, 3366, 3410, 3680, 3726, 4008

Offset: 1

Bruno Berselli, Nov 14 2012

Equivalently, numbers m such that 28*m+1 is a square.
Also, integer values of h*(h+1)/7.
Let F(r) = Product_{n >= 1} 1 - q^(14*n-r). The sequence terms are the exponents in the expansion of F(0)*F(6)*F(8) = 1 - q^6 - q^8 + q^26 + q^30 - q^60 - q^66 + + - - ... (by the triple product identity).- Peter Bala, Dec 25 2024

Bruno Berselli, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. numbers of the form k*(i*k+1) with k in A001057: i=0, A001057; i=1, A110660; i=2, A000217; i=3, A152749; i=4, A074378; i=5, A219190; i=6, A036498; i=7, this sequence; i=8, A154260.
Cf. A113801 (square roots of 28*a(n)+1, see the comment).
Cf. similar sequences listed in A219257.
Subsequence of A011860.

k:=7; f:=func; [0] cat [f(n*m): m in [-1,1], n in [1..25]];

I:=[0,6,8,26,30]; [n le 5 select I[n] else Self(n-1)+2*Self(n-2)-2*Self(n-3)-Self(n-4)+Self(n-5): n in [1..50]]; // Vincenzo Librandi, Aug 18 2013

A := proc (q) local n; for n from 0 to q do if type(sqrt(28*n+1), integer) then print(n) fi; od; end: A(4100); # Peter Bala, Dec 25 2024

Rest[Flatten[{# (7 # - 1), # (7 # + 1)} & /@ Range[0, 25]]]
CoefficientList[Series[2 x (3 + x + 3 x^2) / ((1 + x)^2 (1 - x)^3), {x, 0, 50}], x] (* Vincenzo Librandi, Aug 18 2013 *)
LinearRecurrence[{1,2,-2,-1,1},{0,6,8,26,30},50] (* Harvey P. Dale, Sep 14 2022 *)

G.f.: 2*x^2*(3+x+3*x^2)/((1+x)^2*(1-x)^3).
a(n) = a(-n+1) = (14*n*(n-1)+5*(-1)^n*(2*n-1)+5)/8.
a(n) = 2*A057570(n) = (1/7)*A047335(n)*A047274(n+1).
Sum_{n>=2} 1/a(n) = 7 - cot(Pi/7)*Pi. - Amiram Eldar, Mar 17 2022

A299645 Numbers of the form m(8m + 5), where m is an integer.

Original entry on oeis.org

0, 3, 13, 22, 42, 57, 87, 108, 148, 175, 225, 258, 318, 357, 427, 472, 552, 603, 693, 750, 850, 913, 1023, 1092, 1212, 1287, 1417, 1498, 1638, 1725, 1875, 1968, 2128, 2227, 2397, 2502, 2682, 2793, 2983, 3100, 3300, 3423, 3633, 3762, 3982, 4117, 4347, 4488, 4728, 4875

Offset: 1

Bruno Berselli, Feb 26 2018

Equivalently, numbers k such that 32*k + 25 is a square. This means that 4*a(n) + 3 is a triangular number.

Interleaving of A139277 and A139272 (without 0).

Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A139272, A139277.
Subsequence of A011861, A047222.
Cf. numbers of the form m*(8*m + h): A154260 (h=1), A014494 (h=2), A274681 (h=3), A046092 (h=4), this sequence (h=5), 2*A074377 (h=6), A274979 (h=7).

List([1..50], n -> (8*n*(n-1)-(2*n-1)*(-1)^n-1)/4);

[div((8n*(n-1)-(2n-1)*(-1)^n-1), 4) for n in 1:50] # Peter Luschny, Feb 27 2018

[(8*n*(n-1)-(2*n-1)*(-1)^n-1)/4: n in [1..50]];

seq((exp(I*Pi*x)*(1-2*x)+8*(x-1)*x-1)/4, x=1..50); # Peter Luschny, Feb 27 2018

Table[(8 n (n - 1) - (2 n - 1) (-1)^n - 1)/4, {n, 1, 50}]

makelist((8*n*(n-1)-(2*n-1)*(-1)^n-1)/4, n, 1, 50);

vector(50, n, nn; (8*n*(n-1)-(2*n-1)*(-1)^n-1)/4)

concat(0, Vec(x^2*(3 + 10*x + 3*x^2)/((1 - x)^3*(1 + x)^2) + O(x^60))) \\ Colin Barker, Feb 27 2018

[(8*n*(n-1)-(2*n-1)*(-1)**n-1)/4 for n in range(1, 60)]

def A299645(n): return (n>>1)*((n<<2)+(1 if n&1 else -5)) # Chai Wah Wu, Mar 11 2025

[(8*n*(n-1)-(2*n-1)*(-1)^n-1)/4 for n in (1..50)]

O.g.f.: x^2*(3 + 10*x + 3*x^2)/((1 - x)^3*(1 + x)^2).
E.g.f.: (1 + 2*x - (1 - 8*x^2)*exp(2*x))*exp(-x)/4.
a(n) = a(-n+1) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5).
a(n) = (8*n*(n - 1) - (2*n - 1)*(-1)^n - 1)/4 = (2*n + (-1)^n - 1)*(4*n - 3*(-1)^n - 2)/4. Therefore, 3 and 13 are the only prime numbers in this sequence.
a(n) + a(n+1) = 4*n^2 for even n, otherwise a(n) + a(n+1) = 4*n^2 - 1.
From Amiram Eldar, Mar 18 2022: (Start)
Sum_{n>=2} 1/a(n) = 8/25 + (sqrt(2)-1)*Pi/5.
Sum_{n>=2} (-1)^n/a(n) = 8*log(2)/5 - sqrt(2)*log(2*sqrt(2)+3)/5 - 8/25. (End)
a(n) = (n-1)*(4*n+1)/2 if n is odd and a(n) = n*(4*n-5)/2 if n is even. - Chai Wah Wu, Mar 11 2025

A219190 Numbers of the form k(5k+1), where k = 0,-1,1,-2,2,-3,3,...

Original entry on oeis.org

0, 4, 6, 18, 22, 42, 48, 76, 84, 120, 130, 174, 186, 238, 252, 312, 328, 396, 414, 490, 510, 594, 616, 708, 732, 832, 858, 966, 994, 1110, 1140, 1264, 1296, 1428, 1462, 1602, 1638, 1786, 1824, 1980, 2020, 2184, 2226, 2398, 2442, 2622, 2668, 2856, 2904, 3100

Offset: 1

Bruno Berselli, Nov 14 2012

Equivalently, numbers m such that 20*m+1 is a square.
Also, integer values of h*(h+1)/5.
More generally, for the numbers of the form n*(k*n+1) with n in A001057, we have:
. generating function (offset 1): x^2*(k-1+2*x+(k-1)*x^2)/((1+x)^2*(1-x)^3);
. n-th term: b(n) = (2*k*n*(n-1)+(k-2)*(-1)^n*(2*n-1)+k-2)/8;
. first differences: (n-1)*((-1)^n*(k-2)+k)/2;
. b(2n+1)-b(2n) = 2*n (independent from k);
. (4*k)*b(n)+1 = (2*k*n+(k-2)*(-1)^n-k)^2/4.

Bruno Berselli, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Subsequence of A011858.
Cf. A090771: square roots of 20*a(n)+1 (see the first comment).
Cf. numbers of the form n*(k*n+1) with n in A001057: k=0, A001057; k=1, A110660; k=2, A000217; k=3, A152749; k=4, A074378; k=5, this sequence; k=6, A036498; k=7, A219191; k=8, A154260.
Cf. similar sequences listed in A219257.

k:=5; f:=func; [0] cat [f(n*m): m in [-1,1], n in [1..25]];

I:=[0,4,6,18,22]; [n le 5 select I[n] else Self(n-1)+2*Self(n-2)-2*Self(n-3)-Self(n-4)+Self(n-5): n in [1..50]]; // Vincenzo Librandi, Aug 18 2013

Rest[Flatten[{# (5 # - 1), # (5 # + 1)} & /@ Range[0, 25]]]
CoefficientList[Series[2 x (2 + x + 2 x^2) / ((1 + x)^2 (1 - x)^3), {x, 0, 50}], x] (* Vincenzo Librandi, Aug 18 2013 *)
LinearRecurrence[{1,2,-2,-1,1},{0,4,6,18,22},50] (* Harvey P. Dale, Jan 21 2015 *)

G.f.: 2*x^2*(2 + x + 2*x^2)/((1 + x)^2*(1 - x)^3).
a(n) = a(-n+1) = (10*n*(n-1) + 3*(-1)^n*(2*n - 1) + 3)/8.
a(n) = 2*A057569(n) = A008851(n+1)*A047208(n)/5.
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5). - Harvey P. Dale, Jan 21 2015
Sum_{n>=2} 1/a(n) = 5 - sqrt(1+2/sqrt(5))*Pi. - Amiram Eldar, Mar 15 2022
a(n) = A132356(n-1)/2, n >= 1. - Bernard Schott, Mar 15 2022

A165719 Integers of the form k*(k+9)/8.

Original entry on oeis.org

14, 17, 45, 50, 92, 99, 155, 164, 234, 245, 329, 342, 440, 455, 567, 584, 710, 729, 869, 890, 1044, 1067, 1235, 1260, 1442, 1469, 1665, 1694, 1904, 1935, 2159, 2192, 2430, 2465, 2717, 2754, 3020, 3059, 3339, 3380, 3674, 3717, 4025, 4070, 4392, 4439, 4775

Offset: 1

Vladimir Joseph Stephan Orlovsky, Sep 24 2009

Only one term is a prime number (17). Are all others composite?
There is no prime other than 17 in the first 1 million terms. - Harvey P. Dale, Jan 07 2020
Integers of the form k+k*(k+1)/8 = k+A000217(k)/4; for k see A047521, for A000217(k)/4 see A154260.

			for k = 1,2,..., k(k+9)/8 is 5/4, 11/4, 9/2, 13/2, 35/4, 45/4, 14, 17,.. and the integer values out of these become the sequence.

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

Cf. A000217, A047521, A154260, A165717, A165718.

q=4;s=0;lst={};Do[s+=((n+q)/q);If[IntegerQ[s],AppendTo[lst,s]],{n,6!}];lst
Select[Table[(n(n+9))/8,{n,200}],IntegerQ] (* or *) Rest[Flatten[Table[ {9n+8n^2,14+23n+8n^2},{n,0,30}]]] (* or *) LinearRecurrence[{1,2,-2,-1,1},{14,17,45,50,92},60] (* Harvey P. Dale, Jan 07 2020 *)

From R. J. Mathar, Sep 25 2009: (Start)
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5).
a(n) = 2*n^2 + 6*n + 9/4 - 3*(-1)^n*(2*n+3)/4.
G.f.: x*(-14-3*x+x^3)/((1+x)^2 * (x-1)^3 ). (End)
Sum_{n>=1} 1/a(n) = 89/81 - (sqrt(2)+1)*Pi/9. - Amiram Eldar, Jul 26 2024

Definition simplified by R. J. Mathar, Sep 25 2009

A193470 Square array A(n,k) (n>=1, k>=0) read by antidiagonals: A(n,0) = 0 and A(n,k) is the least integer > A(n,k-1) that can be expressed as a triangular number divided by n.

Original entry on oeis.org

0, 0, 1, 0, 3, 3, 0, 1, 5, 6, 0, 7, 2, 14, 10, 0, 2, 9, 5, 18, 15, 0, 1, 3, 30, 7, 33, 21, 0, 3, 6, 9, 34, 12, 39, 28, 0, 15, 4, 11, 11, 69, 15, 60, 36, 0, 4, 17, 13, 13, 21, 75, 22, 68, 45, 0, 1, 5, 62, 15, 20, 24, 124, 26, 95, 55, 0, 5, 12, 17, 66, 30, 35, 38, 132, 35, 105, 66

Offset: 1

Peter Luschny, Jul 27 2011

			n\k  0   1   2    3    4     5     6     7
------------------------------------------
1 |  0   1   3    6   10    15    21    28    A000217
2 |  0   3   5   14   18    33    39    60    A074378
3 |  0   1   2    5    7    12    15    22    A001318
4 |  0   7   9   30   34    69    75   124    A154260
5 |  0   2   3    9   11    21    24    38    A057569
6 |  0   1   6   11   13    20    35    46    A154293
7 |  0   3   4   13   15    30    33    54    A057570
8 |  0  15  17   62   66   141   147   252    A157716

Cf. A061782, A011772.

A193470_rect := proc(n,k) local j,i,L; L := NULL; j := 0; while nops([L]) < k do add(i/n, i=1..j); if type(%,integer) then L := L,% fi; j := j+1 od; L end:
seq(print(A193470_rect(n, 12)),n = 1..8);

a[, 0] = 0; a[n, k_] := a[n, k] = For[j = a[n, k-1]+1, True, j++, If[Reduce[m > 0 && j == m(m+1)/(2n), m, Integers] =!= False, Return[j]]]; Table[a[n-k, k], {n, 1, 12}, {k, 0, n-1}] // Flatten (* Jean-François Alcover, Nov 07 2016 *)

A332495 a(n-2) = a(n-6) + 5(1+2n) with a(0)=0, a(1)=2, a(2)=7, a(3)=15 for n>=4.

Original entry on oeis.org

0, 2, 7, 15, 25, 37, 52, 70, 90, 112, 137, 165, 195, 227, 262, 300, 340, 382, 427, 475, 525, 577, 632, 690, 750, 812, 877, 945, 1015, 1087, 1162, 1240, 1320, 1402, 1487, 1575, 1665, 1757, 1852, 1950, 2050, 2152, 2257

Offset: 0

Paul Curtz, Feb 14 2020

a(-2)=2, a(-1)=0. 4 evens followed by 4 odds.
Last digit is only 0, 2, 5, 7.
The vertical spoke S-N of the pentagonal spiral for A004526.
                          37
                      37  25  25
                  36  24  15  15  26
              36  24  14   7   8  16  26
          35  23  14   7   2   3   8  16  27
      35  23  13   6   2   0   0   3   9  17  27
        34  22  13   6   1   1   4   9  17  28
          34  22  12   5   5   4  10  18  28
            33  21  12  11  11  10  18  29
              33  21  20  20  19  19  29
                32  32  31  31  30  30
Rank of multiples of 10: 0, 7, 8, 15, 16, ... = A047521. Compare to A154260 in the formula.

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

Cf. A004526, A033429, A062786, A168668, A135706, A147874, 2*A147875 (all in the spiral).

Cf. A005408, A047521, A154260

CoefficientList[Series[x (2 + x + 2 x^2)/((1 - x)^3*(1 + x^2)), {x, 0, 42}], x] (* Michael De Vlieger, Feb 14 2020 *)

concat(0, Vec(x*(2 + x + 2*x^2) / ((1 - x)^3*(1 + x^2)) + O(x^40))) \\ Colin Barker, Feb 14 2020

a(-1-n) = a(n).
a(2*n) + a(1+2*n) = 2, 22, 62, ... = A273366(n).
Second differences give the sequence of period 4: repeat [3, 3, 2, 2].
From Colin Barker, Feb 14 2020: (Start)
G.f.: x*(2 + x + 2*x^2) / ((1 - x)^3*(1 + x^2)).
a(n) = 3*a(n-1) - 4*a(n-2) + 4*a(n-3) - 3*a(n-4) + a(n-5) for n>4.
(End)
Multiples of 10: 10*(0, 7, 9, 30, 34, ... = A154260).
4*a(n) = A087960(n) +5*n -1 +5*n^2. - R. J. Mathar, Feb 28 2020

cp's OEIS Frontend

A057570 Numbers of the form n*(7n+-1)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A057569 Numbers of the form k*(5*k+1)/2 or k*(5*k-1)/2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

A219191 Numbers of the form k*(7*k+1), where k = 0,-1,1,-2,2,-3,3,...

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

Formula

A299645 Numbers of the form m*(8*m + 5), where m is an integer.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Julia

Magma

Maple

Mathematica

Maxima

PARI

PARI

Python

Python

Sage

Formula

A219190 Numbers of the form k*(5*k+1), where k = 0,-1,1,-2,2,-3,3,...

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Mathematica

Formula

A165719 Integers of the form k*(k+9)/8.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

A057569 Numbers of the form k(5k+1)/2 or k(5k-1)/2.

A219191 Numbers of the form k(7k+1), where k = 0,-1,1,-2,2,-3,3,...

A299645 Numbers of the form m(8m + 5), where m is an integer.

A219190 Numbers of the form k(5k+1), where k = 0,-1,1,-2,2,-3,3,...

A332495 a(n-2) = a(n-6) + 5(1+2n) with a(0)=0, a(1)=2, a(2)=7, a(3)=15 for n>=4.