cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A303814 Generalized 24-gonal (or icositetragonal) numbers: m*(11*m - 10) with m = 0, +1, -1, +2, -2, +3, -3, ...

Original entry on oeis.org

0, 1, 21, 24, 64, 69, 129, 136, 216, 225, 325, 336, 456, 469, 609, 624, 784, 801, 981, 1000, 1200, 1221, 1441, 1464, 1704, 1729, 1989, 2016, 2296, 2325, 2625, 2656, 2976, 3009, 3349, 3384, 3744, 3781, 4161, 4200, 4600, 4641, 5061, 5104, 5544, 5589, 6049, 6096, 6576, 6625
Offset: 0

Views

Author

Omar E. Pol, Jun 06 2018

Keywords

Comments

a(25) = 1729 is the Hardy-Ramanujan number.
Numbers k such that 11*k + 25 is a square. - Bruno Berselli, Jun 08 2018
Partial sums of A317320. - Omar E. Pol, Jul 28 2018

Links

Crossrefs

Cf. A051876, A317320.
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), A195313 (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), this sequence (k=24), A303304 (k=25), A316724 (k=26), A316725 (k=27), A303812 (k=28), A303815 (k=29), A316729 (k=30).

Programs

  • Mathematica
    With[{pp = 24, nn = 55}, {0}~Join~Riffle[Array[PolygonalNumber[pp, #] &, Ceiling[nn/2]], Array[PolygonalNumber[pp, -#] &, Ceiling[nn/2]]]] (* Michael De Vlieger, Jun 06 2018 *)
Table[(22 n (n + 1) + 9 (2 n + 1) (-1)^n - 9)/8, {n, 0, 50}] (* Bruno Berselli, Jun 08 2018 *)
CoefficientList[ Series[-x (x^2 + 20x + 1)/((x - 1)^3 (x + 1)^2), {x, 0, 50}], x] (* or *)
LinearRecurrence[{1, 2, -2, -1, 1}, {0, 1, 21, 24, 64}, 50] (* Robert G. Wilson v, Jul 28 2018 *)
  • PARI
    concat(0, Vec(x*(1 + 20*x + x^2)/((1 + x)^2*(1 - x)^3) + O(x^40))) \\ Colin Barker, Jun 12 2018

Formula

From Bruno Berselli, Jun 08 2018: (Start)
G.f.: x*(1 + 20*x + x^2)/((1 + x)^2*(1 - x)^3).
a(n) = a(-n-1) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5).
a(n) = (22*n*(n + 1) + 9*(2*n + 1)*(-1)^n - 9)/8. Therefore:
a(n) = n*(11*n + 20)/4, if n is even, or (n + 1)*(11*n - 9)/4 otherwise.
(2*n - 1)*a(n) + (2*n + 1)*a(n-1) - n*(11*n^2 - 10) = 0. (End)
Sum_{n>=1} 1/a(n) = (11 + 10*Pi*cot(Pi/11))/100. - Amiram Eldar, Mar 01 2022

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

Views

Author

Omar E. Pol, Sep 14 2011

Keywords

Comments

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

Examples

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

Crossrefs

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

Programs

A317326 Multiples of 26 and odd numbers interleaved.

Original entry on oeis.org

0, 1, 26, 3, 52, 5, 78, 7, 104, 9, 130, 11, 156, 13, 182, 15, 208, 17, 234, 19, 260, 21, 286, 23, 312, 25, 338, 27, 364, 29, 390, 31, 416, 33, 442, 35, 468, 37, 494, 39, 520, 41, 546, 43, 572, 45, 598, 47, 624, 49, 650, 51, 676, 53, 702, 55, 728, 57, 754, 59, 780, 61, 806, 63, 832, 65, 858, 67, 884, 69
Offset: 0

Views

Author

Omar E. Pol, Jul 25 2018

Keywords

Comments

a(n) is the length of the n-th line segment of the rectangular spiral whose vertices are the generalized 30-gonal numbers (A316729).
Partial sums give the generalized 30-gonal numbers.
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.
From Bruno Berselli, Jul 27 2018: (Start)
Also, this type of sequence is characterized by:
O.g.f.: x*(1 + m*x + x^2)/(1 - x^2)^2;
E.g.f.: x*(2 - m + (2 + m)*exp(2*x))*exp(-x)/4;
a(n) = -a(-n) = (2 + m - (2 - m)*(-1)^n)*n/4;
a(n) = (m/2)^((1 + (-1)^n)/2)*n;
a(n) = 2*a(n-2) - a(n-4), with signature (0,2,0,-1). (End)

Links

Crossrefs

Cf. A252994 and A005408 interleaved.
Column 26 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), A317314 (k=18), A317315 (k=19), A317316 (k=20), A317317 (k=21), A317318 (k=22), A317319 (k=23), A317320 (k=24), A317321 (k=25), A317322 (k=26), A317323 (k=27), A317324 (k=28), A317325 (k=29), this sequence (k=30).
Cf. A316729.

Programs

  • Julia
    [13^div(1+(-1)^n,2)*n for n in 0:70] |> println # Bruno Berselli, Jul 28 2018
  • Mathematica
    Table[(7 + 6 (-1)^n) n, {n, 0, 70}] (* Bruno Berselli, Jul 27 2018 *)

Formula

a(2*n) = 26*n, a(2*n+1) = 2*n + 1.
From Bruno Berselli, Jul 27 2018: (Start)
O.g.f.: x*(1 + 26*x + x^2)/(1 - x^2)^2.
E.g.f.: x*(-6 + 7*exp(2*x))*exp(-x).
a(n) = -a(-n) = (7 + 6*(-1)^n)*n.
a(n) = 13^((1 + (-1)^n)/2)*n.
a(n) = 2*a(n-2) - a(n-4). (End)
Multiplicative with a(2^e) = 13*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^(3-s)). - Amiram Eldar, Oct 26 2023
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.