A195312 -id:A195312 - cp's OEIS frontend

A195313 Generalized 13-gonal numbers: m(11m-9)/2 with m = 0, 1, -1, 2, -2, 3, -3, ...

0, 1, 10, 13, 31, 36, 63, 70, 106, 115, 160, 171, 225, 238, 301, 316, 388, 405, 486, 505, 595, 616, 715, 738, 846, 871, 988, 1015, 1141, 1170, 1305, 1336, 1480, 1513, 1666, 1701, 1863, 1900, 2071, 2110, 2290, 2331, 2520, 2563, 2761, 2806, 3013, 3060, 3276

Offset: 0

Omar E. Pol, Sep 14 2011

Also generalized tridecagonal numbers or generalized triskaidecagonal numbers.
Also A211013 and positive terms of A051865 interleaved. - Omar E. Pol, Aug 04 2012
Numbers k for which 88*k + 81 is a square. - Bruno Berselli, Jul 10 2018

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

Partial sums of A195312.
Column 9 of A195152.
Cf. A316672.
Sequences of generalized k-gonal numbers: A001318 (k=5), A000217 (k=6), A085787 (k=7), A001082 (k=8), A118277 (k=9), A074377 (k=10), A195160 (k=11), A195162 (k=12), this sequence (k=13), A195818 (k=14), A277082 (k=15), A274978 (k=16), A303305 (k=17), A274979 (k=18), A303813 (k=19), A218864 (k=20), A303298 (k=21), A303299 (k=22), A303303 (k=23), A303814 (k=24), A303304 (k=25), A316724 (k=26), A316725 (k=27), A303812 (k=28), A303815 (k=29), A316729 (k=30).

[(22*n*(n+1)+7*(2*n+1)*(-1)^n-7)/16: n in [0..50]]; // Vincenzo Librandi, Sep 16 2011

A195313:=func; [0] cat [A195313(n*m): m in [1,-1], n in [1..25]]; // Bruno Berselli, Nov 13 2012

a:= n-> (m-> m*(11*m-9)/2)(-ceil(n/2)*(-1)^n):
seq(a(n), n=0..60);  # Alois P. Heinz, Jul 10 2018

lim = 50; Sort[Table[n*(11*n - 9)/2, {n, -lim, lim}]] (* T. D. Noe, Sep 15 2011 *)
Accumulate[With[{nn=30},Riffle[9Range[0,nn],Range[1,2nn+1,2]]]] (* Harvey P. Dale, Sep 24 2011 *)

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

From Bruno Berselli, Sep 15 2011: (Start)
G.f.: x*(1 + 9*x + x^2)/((1 + x)^2*(1 - x)^3).
a(n) = (22*n*(n + 1) + 7*(2*n + 1)*(-1)^n - 7)/16.
a(n) - a(n-2) = A175885(n). (End)
Sum_{n>=1} 1/a(n) = 22/81 + 2*Pi*cot(2*Pi/11)/9. - Vaclav Kotesovec, Oct 05 2016

A195161 Multiples of 8 and odd numbers interleaved.

Original entry on oeis.org

0, 1, 8, 3, 16, 5, 24, 7, 32, 9, 40, 11, 48, 13, 56, 15, 64, 17, 72, 19, 80, 21, 88, 23, 96, 25, 104, 27, 112, 29, 120, 31, 128, 33, 136, 35, 144, 37, 152, 39, 160, 41, 168, 43, 176, 45, 184, 47, 192, 49, 200, 51, 208, 53, 216, 55, 224, 57, 232, 59

Offset: 0

Omar E. Pol, Sep 10 2011

A008590 and A005408 interleaved. This is 8*n if n is even, n if n is odd, if n>=0.
Partial sums give the generalized 12-gonal (or dodecagonal) numbers A195162.
The moment generating function of p(x, m=2, n=1, mu=2) = 4*x*E(x, 2, 1), see A163931 and A274181, is given by M(a) = (- 4*log(1-a) - 4 * polylog(2, a))/a^2. The series expansion of M(a) leads to the sequence given above. - Johannes W. Meijer, Jul 03 2016
a(n) is also the length of the n-th line segment of the rectangular spiral whose vertices are the generalized 12-gonal numbers. - Omar E. Pol, Jul 27 2018

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

Column 8 of A195151.
Sequences whose partial sums give the generalized n-gonal numbers, if n>=5: A026741, A001477, zero together with A080512, A022998, A195140, zero together with A165998, A195159, this sequence, A195312.
Cf. A144433.

&cat[[8*n, 2*n+1]: n in [0..30]]; // Vincenzo Librandi, Sep 27 2011

a := proc(n): (6*(-1)^n+10)*n/4 end: seq(a(n), n=0..59); # Johannes W. Meijer, Jul 03 2016

With[{nn=30},Riffle[8*Range[0,nn],2*Range[0,nn]+1]] (* or *) LinearRecurrence[{0,2,0,-1},{0,1,8,3},60] (* Harvey P. Dale, Nov 24 2013 *)

concat(0, Vec(x*(1+8*x+x^2)/((1-x)^2*(1+x)^2) + O(x^99))) \\ Altug Alkan, Jul 04 2016

a(2n) = 8n, a(2n+1) = 2n+1. [corrected by Omar E. Pol, Jul 26 2018]
a(n) = (6*(-1)^n+10)*n/4. - Vincenzo Librandi, Sep 27 2011
a(n) = 2*a(n-2)-a(n-4). G.f.: x*(1+8*x+x^2)/((1-x)^2*(1+x)^2). - Colin Barker, Aug 11 2012
From Ilya Gutkovskiy, Jul 03 2016: (Start)
a(m*2^k) = m*2^(k+2), k>0.
E.g.f.: x*(4*sinh(x) + cosh(x)).
Dirichlet g.f.: 2^(-s)*(2^s + 6)*zeta(s-1). (End)
Multiplicative with a(2^e) = 4*2^e, a(p^e) = p^e for odd prime p. - Andrew Howroyd, Jul 23 2018
a(n) = A144433(n-1) for n > 1. - Georg Fischer, Oct 14 2018

A195140 Multiples of 5 and odd numbers interleaved.

Original entry on oeis.org

0, 1, 5, 3, 10, 5, 15, 7, 20, 9, 25, 11, 30, 13, 35, 15, 40, 17, 45, 19, 50, 21, 55, 23, 60, 25, 65, 27, 70, 29, 75, 31, 80, 33, 85, 35, 90, 37, 95, 39, 100, 41, 105, 43, 110, 45, 115, 47, 120, 49, 125, 51, 130, 53, 135, 55, 140, 57, 145, 59, 150, 61, 155, 63

Offset: 0

Omar E. Pol, Sep 10 2011

This is 5*n/2 if n is even, n if n is odd.
Partial sums give the generalized enneagonal numbers A118277.
a(n) is also the length of the n-th line segment of a rectangular spiral on the infinite square grid. The vertices of the spiral are the generalized enneagonal numbers. - Omar E. Pol, Jul 27 2018

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

A008587 and A005408 interleaved.
Column 5 of A195151.
Cf. Sequences whose partial sums give the generalized n-gonal numbers, if n>=5: A026741, A001477, zero together with A080512, A022998, this sequence, zero together with A165998, A195159, A195161, A195312.
Cf. A047336, A118277.

&cat[[5*n,2*n+1]: n in [0..31]]; // Bruno Berselli, Sep 27 2011

With[{nn=40},Riffle[5*Range[0,nn],Range[1,2nn+1,2]]] (* or *) LinearRecurrence[ {0,2,0,-1},{0,1,5,3},80] (* Harvey P. Dale, Dec 15 2014 *)

a(n)=(7+3*(-1)^n)*n/4 \\ Charles R Greathouse IV, Oct 07 2015

a(2n) = 5n, a(2n+1) = 2n+1.
G.f.: x*(1+5*x+x^2) / ((x-1)^2*(x+1)^2). - Alois P. Heinz, Sep 26 2011
From Bruno Berselli, Sep 27 2011: (Start)
a(n) = (7+3*(-1)^n)*n/4.
a(n) = -a(-n) = a(n-2)*n/(n-2) = 2*a(n-2)-a(n-4).
a(n) + a(n-1) = A047336(n). (End)
Multiplicative with a(2^e) = 5*2^(e-1), a(p^e) = p^e for odd prime p. - Andrew Howroyd, Jul 23 2018
Dirichlet g.f.: zeta(s-1) * (1 + 3/2^s). - Amiram Eldar, Oct 25 2023

Corrected and edited by Alois P. Heinz, Sep 25 2011

A195151 Square array read by antidiagonals upwards: T(n,k) = n((k-2)(-1)^n+k+2)/4, n >= 0, k >= 0.

Original entry on oeis.org

0, 1, 0, 0, 1, 0, 3, 1, 1, 0, 0, 3, 2, 1, 0, 5, 2, 3, 3, 1, 0, 0, 5, 4, 3, 4, 1, 0, 7, 3, 5, 6, 3, 5, 1, 0, 0, 7, 6, 5, 8, 3, 6, 1, 0, 9, 4, 7, 9, 5, 10, 3, 7, 1, 0, 0, 9, 8, 7, 12, 5, 12, 3, 8, 1, 0, 11, 5, 9, 12, 7, 15, 5, 14, 3, 9, 1, 0, 0, 11, 10, 9, 16, 7

Offset: 0

Omar E. Pol, Sep 14 2011

Also square array T(n,k) read by antidiagonals in which column k lists the multiples of k and the odd numbers interleaved, n>=0, k>=0. Also square array T(n,k) read by antidiagonals in which if n is even then row n lists the multiples of (n/2), otherwise if n is odd then row n lists a constant sequence: the all n's sequence. Partial sums of the numbers of column k give the column k of A195152. Note that if k >= 1 then partial sums of the numbers of the column k give the generalized m-gonal numbers, where m = k + 4.

All columns are multiplicative. - Andrew Howroyd, Jul 23 2018

			Array begins:
.  0,   0,   0,   0,   0,   0,   0,   0,   0,   0,...
.  1,   1,   1,   1,   1,   1,   1,   1,   1,   1,...
.  0,   1,   2,   3,   4,   5,   6,   7,   8,   9,...
.  3,   3,   3,   3,   3,   3,   3,   3,   3,   3,...
.  0,   2,   4,   6,   8,  10,  12,  14,  16,  18,...
.  5,   5,   5,   5,   5,   5,   5,   5,   5,   5,...
.  0,   3,   6,   9,  12,  15,  18,  21,  24,  27,...
.  7,   7,   7,   7,   7,   7,   7,   7,   7,   7,...
.  0,   4,   8,  12,  16,  20,  24,  28,  32,  36,...
.  9,   9,   9,   9,   9,   9,   9,   9,   9,   9,...
.  0,   5,  10,  15,  20,  25,  30,  35,  40,  45,...
...

Rows: A000004, A000012, A001477, A010701, A005843, A010716, A008585, A010727, A008586, A010734, A008587.

Columns k: A026741 (k=1), A001477 (k=2), zero together with A080512 (k=3), A022998 (k=4), A195140 (k=5), zero together with A165998 (k=6), A195159 (k=7), A195161 (k=8), A195312 k=(9), A195817 (k=10), A317311 (k=11), A317312 (k=12), A317313 (k=13), A317314 k=(14), A317315 (k=15), A317316 (k=16), A317317 (k=17), A317318 (k=18), A317319 k=(19), A317320 (k=20), A317321 (k=21), A317322 (k=22), A317323 (k=23), A317324 k=(24), A317325 (k=25), A317326 (k=26).

T(n,k) = n*((k-2)*(-1)^n+k+2)/4 \\ Andrew Howroyd, Jul 23 2018

A195817 Multiples of 10 and odd numbers interleaved.

Original entry on oeis.org

0, 1, 10, 3, 20, 5, 30, 7, 40, 9, 50, 11, 60, 13, 70, 15, 80, 17, 90, 19, 100, 21, 110, 23, 120, 25, 130, 27, 140, 29, 150, 31, 160, 33, 170, 35, 180, 37, 190, 39, 200, 41, 210, 43, 220, 45, 230, 47, 240, 49, 250, 51, 260, 53, 270, 55, 280, 57, 290, 59, 300

Offset: 0

Omar E. Pol, Sep 29 2011

A008592 and A005408 interleaved.
Partial sums give the generalized 14-gonal (or tetradecagonal) numbers A195818.
a(n) is also the length of the n-th line segment of a rectangular spiral on the infinite square grid. The vertices of the spiral are the generalized 14-gonal numbers. - Omar E. Pol, Jul 27 2018

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

Column 10 of A195151.
Sequences whose partial sums give the generalized n-gonal numbers, if n>=5: A026741, A001477, zero together with A080512, A022998, A195140, zero together with A165998, A195159, A195161, A195312, this sequence.
Cf. A091998, A195152.

[(2*(-1)^n+3)*n: n in [0..60]]; // Vincenzo Librandi, Sep 30 2011

With[{nn=30},Riffle[10*Range[0,nn],Range[1,2*nn+1,2]]] (* or *) LinearRecurrence[{0,2,0,-1},{0,1,10,3},70] (* Harvey P. Dale, Nov 24 2013 *)

a(n) = (2*(-1)^n+3)*n; \\ Andrew Howroyd, Jul 23 2018

a(n) = (2*(-1)^n+3)*n. - Vincenzo Librandi, Sep 30 2011
From Bruno Berselli, Sep 30 2011: (Start)
G.f.: x*(1+10*x+x^2)/((1-x)^2*(1+x)^2).
a(n) = -a(-n) = a(n-2)*n/(n-2) = 2*a(n-2)-a(n-4).
a(n) * a(n+1) = a(n(n+1)).
a(n) + a(n+1) = A091998(n+1). (End)
a(0)=0, a(1)=1, a(2)=10, a(3)=3, a(n)=2*a(n-2)-a(n-4). - Harvey P. Dale, Nov 24 2013
Multiplicative with a(2^e) = 5*2^e, a(p^e) = p^e for odd prime p. - Andrew Howroyd, Jul 23 2018
Dirichlet g.f.: zeta(s-1) * (1 + 2^(3-s)). - Amiram Eldar, Oct 25 2023

A175885 Numbers that are congruent to {1, 10} mod 11.

Original entry on oeis.org

1, 10, 12, 21, 23, 32, 34, 43, 45, 54, 56, 65, 67, 76, 78, 87, 89, 98, 100, 109, 111, 120, 122, 131, 133, 142, 144, 153, 155, 164, 166, 175, 177, 186, 188, 197, 199, 208, 210, 219, 221, 230, 232, 241, 243, 252, 254, 263, 265, 274, 276, 285, 287, 296, 298

Offset: 1

Bruno Berselli, Oct 08 2010 - Nov 17 2010

Cf. property described by Gary Detlefs in A113801: more generally, these numbers are of the form (2*h*n + (h-4)*(-1)^n - h)/4 (h, n natural numbers), therefore ((2*h*n + (h-4)*(-1)^n - h)/4)^2 - 1 == 0 (mod h); in this case, a(n)^2 - 1 == 0 (mod 11).

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

Cf. A090771 (n==1 or 9 mod 10), A091998 (n==1 or 11 mod 12).
Cf. A195043 (partial sums).
Cf. A000217, A005408, A047209, A007310, A047336, A047522, A056020, A113801, A175886, A175887, A195312, A195313.

a175885 n = a175885_list !! (n-1)
a175885_list = 1 : 10 : map (+ 11) a175885_list
-- Reinhard Zumkeller, Jan 07 2012

[(22*n+7*(-1)^n-11)/4: n in [1..60]]; // Vincenzo Librandi, Sep 19 2011

Rest[Flatten[{#-1,#+1}&/@(11 Range[0,50])]] (* Harvey P. Dale, Nov 05 2010 *)

a(n)=n%2*9 + 1 \\ Charles R Greathouse IV, Aug 01 2016

G.f.: x*(1+9*x+x^2)/((1+x)*(1-x)^2).
a(n) = (22*n + 7*(-1)^n - 11)/4.
a(n) = -a(-n+1) = a(n-2) + 11 = a(n-1) + a(n-2) - a(n-3).
a(n) = 11*A000217(n-1) + 1 - 2*Sum_{i=1..n-1} a(i) for n > 1.
a(n) = A195312(n) + A195312(n-1) = A195313(n) - A195313(n-2). - Bruno Berselli, Sep 18 2011
Sum_{n>=1} (-1)^(n+1)/a(n) = (Pi/11)*cot(Pi/11). - Amiram Eldar, Dec 04 2021
E.g.f.: 1 + ((22*x - 11)*exp(x) + 7*exp(-x))/4. - David Lovler, Sep 04 2022
From Amiram Eldar, Nov 23 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = 2*cos(Pi/11).
Product_{n>=2} (1 + (-1)^n/a(n)) = (Pi/11)*cosec(Pi/11). (End)

A317311 Multiples of 11 and odd numbers interleaved.

Original entry on oeis.org

0, 1, 11, 3, 22, 5, 33, 7, 44, 9, 55, 11, 66, 13, 77, 15, 88, 17, 99, 19, 110, 21, 121, 23, 132, 25, 143, 27, 154, 29, 165, 31, 176, 33, 187, 35, 198, 37, 209, 39, 220, 41, 231, 43, 242, 45, 253, 47, 264, 49, 275, 51, 286, 53, 297, 55, 308, 57, 319, 59, 330, 61, 341, 63, 352, 65, 363, 67, 374, 69

Offset: 0

Omar E. Pol, Jul 25 2018

Partial sums give the generalized 15-gonal numbers (A277082).

a(n) is also the length of the n-th line segment of the rectangular spiral wh0se vertices are the generalized 15-gonal numbers.

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

Cf. A008593 and A005408 interleaved.
Column 11 of A195151.
Sequences whose partial sums give the generalized k-gonal numbers: A026741 (k=5), A001477 (k=6), zero together with A080512 (k=7), A022998 (k=8), A195140 (k=9), zero together with A165998 (k=10), A195159 (k=11), A195161 (k=12), A195312 (k=13), A195817 (k=14).
Cf. A277082.

{0}~Join~Riffle[2 Range@ # - 1, 11 Range@ #] &@ 35 (* or *)
CoefficientList[Series[x (1 + 11 x + x^2)/((1 - x)^2*(1 + x)^2), {x, 0, 69}], x] (* Michael De Vlieger, Jul 26 2018 *)
LinearRecurrence[{0,2,0,-1},{0,1,11,3},90] (* Harvey P. Dale, Aug 28 2022 *)

concat(0, Vec(x*(1 + 11*x + x^2) / ((1 - x)^2*(1 + x)^2) + O(x^40))) \\ Colin Barker, Jul 26 2018

a(2n) = 11*n, a(2n+1) = 2*n + 1.
From Colin Barker, Jul 26 2018: (Start)
G.f.: x*(1 + 11*x + x^2) / ((1 - x)^2*(1 + x)^2).
a(n) = 2*a(n-2) - a(n-4) for n>3. (End)
Multiplicative with a(2^e) = 11*2^(e-1), and a(p^e) = p^e for an odd prime p. - Amiram Eldar, Oct 14 2023
Dirichlet g.f.: zeta(s-1) * (1 + 9/2^s). - Amiram Eldar, Oct 25 2023
a(n) = (13 + 9*(-1)^n)*n/4. - Aaron J Grech, Aug 20 2024

A317312 Multiples of 12 and odd numbers interleaved.

Original entry on oeis.org

0, 1, 12, 3, 24, 5, 36, 7, 48, 9, 60, 11, 72, 13, 84, 15, 96, 17, 108, 19, 120, 21, 132, 23, 144, 25, 156, 27, 168, 29, 180, 31, 192, 33, 204, 35, 216, 37, 228, 39, 240, 41, 252, 43, 264, 45, 276, 47, 288, 49, 300, 51, 312, 53, 324, 55, 336, 57, 348, 59, 360, 61, 372, 63, 384, 65, 396, 67, 408, 69

Offset: 0

Omar E. Pol, Jul 25 2018

Partial sums give the generalized 16-gonal numbers (A274978).

a(n) is also the length of the n-th line segment of the rectangular spiral whose vertices are the generalized 16-gonal numbers.

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

Cf. A008594 and A005408 interleaved.
Column 12 of A195151.
Sequences whose partial sums give the generalized k-gonal numbers: A026741 (k=5), A001477 (k=6), zero together with A080512 (k=7), A022998 (k=8), A195140 (k=9), zero together with A165998 (k=10), A195159 (k=11), A195161 (k=12), A195312 (k=13), A195817 (k=14), A317311 (k=15).
Cf. A274978.

{0}~Join~Riffle[2 Range@ # - 1, 12 Range@ #] &@ 35 (* or *)
CoefficientList[Series[x (1 + 12 x + x^2)/((1 - x)^2*(1 + x)^2), {x, 0, 69}], x] (* or *)
LinearRecurrence[{0, 2, 0, -1}, {0, 1, 12, 3}, 70] (* Michael De Vlieger, Jul 26 2018 *)

a(2n) = 12*n, a(2n+1) = 2*n + 1.
From Michael De Vlieger, Jul 26 2018: (Start)
G.f.: x*(1 + 12*x + x^2) / ((1 - x)^2*(1 + x)^2).
a(n) = 2*a(n-2) - a(n-4) for n>3. (End)
Multiplicative with a(2^e) = 3*2^(e+1), and a(p^e) = p^e for an odd prime p. - Amiram Eldar, Oct 14 2023
Dirichlet g.f.: zeta(s-1) * (1 + 5*2^(1-s)). - Amiram Eldar, Oct 25 2023
a(n) = (7 + 5*(-1)^n)*n/2. - Aaron J Grech, Aug 20 2024

A317313 Multiples of 13 and odd numbers interleaved.

Original entry on oeis.org

0, 1, 13, 3, 26, 5, 39, 7, 52, 9, 65, 11, 78, 13, 91, 15, 104, 17, 117, 19, 130, 21, 143, 23, 156, 25, 169, 27, 182, 29, 195, 31, 208, 33, 221, 35, 234, 37, 247, 39, 260, 41, 273, 43, 286, 45, 299, 47, 312, 49, 325, 51, 338, 53, 351, 55, 364, 57, 377, 59, 390, 61, 403, 63, 416, 65, 429, 67, 442, 69

Offset: 0

Omar E. Pol, Jul 25 2018

Partial sums give the generalized 17-gonal numbers (A303305).
More generally, the partial sums of the sequence formed by the multiples of m and the odd numbers interleaved, give the generalized k-gonal numbers, with m >= 1 and k = m + 4.
a(n) is also the length of the n-th line segment of the rectangular spiral whose vertices are the generalized 17-gonal numbers.

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

Cf. A008595 and A005408 interleaved.
Column 13 of A195151.
Sequences whose partial sums give the generalized k-gonal numbers: A026741 (k=5), A001477 (k=6), zero together with A080512 (k=7), A022998 (k=8), A195140 (k=9), zero together with A165998 (k=10), A195159 (k=11), A195161 (k=12), A195312 (k=13), A195817 (k=14), A317311 (k=15), A317312 (k=16).
Cf. A303305.

Table[{13n, 2n + 1}, {n, 0, 35}] // Flatten (* or *)
CoefficientList[Series[(x^3 + 13 x^2 + x)/(x^2 - 1)^2, {x, 0, 69}], x] (* or *)
LinearRecurrence[{0, 2, 0, -1}, {0, 1, 13, 3}, 70] (* Robert G. Wilson v, Jul 26 2018 *)

a(n) = if(n%2==0, return((n/2)*13), return(n)) \\ Felix Fröhlich, Jul 26 2018

concat(0, Vec(x*(1 + 13*x + x^2) / ((1 - x)^2*(1 + x)^2) + O(x^60))) \\ Colin Barker, Jul 29 2018

a(2n) = 13*n, a(2n+1) = 2*n + 1.
From Colin Barker, Jul 29 2018: (Start)
G.f.: x*(1 + 13*x + x^2) / ((1 - x)^2*(1 + x)^2).
a(n) = 2*a(n-2) - a(n-4) for n>3. (End)
Multiplicative with a(2^e) = 13*2^(e-1), and a(p^e) = p^e for an odd prime p. - Amiram Eldar, Oct 14 2023
Dirichlet g.f.: zeta(s-1) * (1 + 11/2^s). - Amiram Eldar, Oct 25 2023
a(n) = (15 + 11*(-1)^n)*n/4. - Aaron J Grech, Aug 20 2024

A317314 Multiples of 14 and odd numbers interleaved.

Original entry on oeis.org

0, 1, 14, 3, 28, 5, 42, 7, 56, 9, 70, 11, 84, 13, 98, 15, 112, 17, 126, 19, 140, 21, 154, 23, 168, 25, 182, 27, 196, 29, 210, 31, 224, 33, 238, 35, 252, 37, 266, 39, 280, 41, 294, 43, 308, 45, 322, 47, 336, 49, 350, 51, 364, 53, 378, 55, 392, 57, 406, 59, 420, 61, 434, 63, 448, 65, 462, 67, 476, 69

Offset: 0

Omar E. Pol, Jul 25 2018

Partial sums give the generalized 18-gonal numbers (A274979).

a(n) is also the length of the n-th line segment of the rectangular spiral whose vertices are the generalized 18-gonal numbers.

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

Cf. A008596 and A005408 interleaved.
Column 14 of A195151.
Sequences whose partial sums give the generalized k-gonal numbers: A026741 (k=5), A001477 (k=6), zero together with A080512 (k=7), A022998 (k=8), A195140 (k=9), zero together with A165998 (k=10), A195159 (k=11), A195161 (k=12), A195312 (k=13), A195817 (k=14), A317311 (k=15), A317312 (k=16), A317313 (k=17).
Cf. A274979.

Table[4 n + 3 n (-1)^n, {n, 0, 80}] (* Wesley Ivan Hurt, Nov 25 2021 *)

a(n) = if(n%2==0, return(14*n/2), return(n)) \\ Felix Fröhlich, Jul 26 2018

concat(0, Vec(x*(1 + 14*x + x^2) / ((1 - x)^2*(1 + x)^2) + O(x^60))) \\ Colin Barker, Jul 29 2018

a(2n) = 14*n, a(2n+1) = 2*n + 1.
From Colin Barker, Jul 29 2018: (Start)
G.f.: x*(1 + 14*x + x^2) / ((1 - x)^2*(1 + x)^2).
a(n) = 2*a(n-2) - a(n-4) for n>3. (End)
a(n) = 4*n + 3*n*(-1)^n. - Wesley Ivan Hurt, Nov 25 2021
Multiplicative with a(2^e) = 7*2^e, and a(p^e) = p^e for an odd prime p. - Amiram Eldar, Oct 14 2023
Dirichlet g.f.: zeta(s-1) * (1 + 3*2^(2-s)). - Amiram Eldar, Oct 25 2023

cp's OEIS Frontend

A195313 Generalized 13-gonal numbers: m*(11*m-9)/2 with m = 0, 1, -1, 2, -2, 3, -3, ...

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Maple

Mathematica

PARI

Formula

A195161 Multiples of 8 and odd numbers interleaved.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A195140 Multiples of 5 and odd numbers interleaved.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A195151 Square array read by antidiagonals upwards: T(n,k) = n*((k-2)*(-1)^n+k+2)/4, n >= 0, k >= 0.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

A195817 Multiples of 10 and odd numbers interleaved.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A175885 Numbers that are congruent to {1, 10} mod 11.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

A317311 Multiples of 11 and odd numbers interleaved.

Views

Author

Keywords

Comments

A195313 Generalized 13-gonal numbers: m(11m-9)/2 with m = 0, 1, -1, 2, -2, 3, -3, ...

A195151 Square array read by antidiagonals upwards: T(n,k) = n((k-2)(-1)^n+k+2)/4, n >= 0, k >= 0.