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-10 of 15 results. Next

A321807 a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^10.

Original entry on oeis.org

1, -1025, 59050, -1047553, 9765626, -60526250, 282475250, -1072692225, 3486843451, -10009766650, 25937424602, -61858004650, 137858491850, -289537131250, 576660215300, -1098436836353, 2015993900450, -3574014537275, 6131066257802
Offset: 1

Views

Author

N. J. A. Sloane, Nov 23 2018

Keywords

Crossrefs

Column k=10 of A322083.
Cf. A321543 - A321565, A321808 - A321836 for similar sequences.

Programs

  • Mathematica
    a[n_] := DivisorSum[n, (-1)^(# + n/#)*#^10 &]; Array[a, 50] (* Amiram Eldar, Nov 22 2022 *)
  • PARI
    apply( A321807(n)=sumdiv(n, d, (-1)^(d-n\d)*d^10), [1..30]) \\ M. F. Hasler, Nov 26 2018

Formula

G.f.: Sum_{k>=1} (-1)^(k+1)*k^10*x^k/(1 + x^k). - Ilya Gutkovskiy, Dec 22 2018
Multiplicative with a(2^e) = -(511*2^(10*e+1) + 2047)/1023, and a(p^e) = (p^(10*e+10) - 1)/(p^10 - 1) for p > 2. - Amiram Eldar, Nov 22 2022

A321565 a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^9.

Original entry on oeis.org

1, -513, 19684, -261633, 1953126, -10097892, 40353608, -133955073, 387440173, -1001953638, 2357947692, -5149983972, 10604499374, -20701400904, 38445332184, -68584996353, 118587876498, -198756808749, 322687697780, -511002214758
Offset: 1

Views

Author

N. J. A. Sloane, Nov 23 2018

Keywords

Crossrefs

Column k=9 of A322083.
Cf. A321543 - A321564, A321807 - A321836 for similar sequences.

Programs

  • Mathematica
    CoefficientList[Series[Sum[(-1)^(k+1) k^9 x^k/(1+x^k),{k,20}],{x,0,20}],x] (* Harvey P. Dale, Apr 09 2019 *)
    a[n_] := DivisorSum[n, (-1)^(# + n/#)*#^9 &]; Array[a, 25] (* Amiram Eldar, Nov 22 2022 *)
  • PARI
    apply( A321565(n)=sumdiv(n, d, (-1)^(n\d-d)*d^9), [1..30]) \\ M. F. Hasler, Nov 26 2018

Formula

G.f.: Sum_{k>=1} (-1)^(k+1)*k^9*x^k/(1 + x^k). - Ilya Gutkovskiy, Dec 22 2018
Multiplicative with a(2^e) = -3*(85*2^(9*e+1) + 341)/511, and a(p^e) = (p^(9*e+9) - 1)/(p^9 - 1) for p > 2. - Amiram Eldar, Nov 22 2022

A322143 Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n, d==1 (mod 4)} d^k - Sum_{d|n, d==3 (mod 4)} d^k.

Original entry on oeis.org

1, 1, 1, 1, 1, 0, 1, 1, -2, 1, 1, 1, -8, 1, 2, 1, 1, -26, 1, 6, 0, 1, 1, -80, 1, 26, -2, 0, 1, 1, -242, 1, 126, -8, -6, 1, 1, 1, -728, 1, 626, -26, -48, 1, 1, 1, 1, -2186, 1, 3126, -80, -342, 1, 7, 2, 1, 1, -6560, 1, 15626, -242, -2400, 1, 73, 6, 0, 1, 1, -19682, 1, 78126, -728, -16806, 1, 703, 26, -10, 0
Offset: 1

Views

Author

Ilya Gutkovskiy, Nov 28 2018

Keywords

Examples

			Square array begins:
  1,  1,   1,    1,    1,     1,  ...
  1,  1,   1,    1,    1,     1,  ...
  0, -2,  -8,  -26,  -80,  -242,  ...
  1,  1,   1,    1,    1,     1,  ...
  2,  6,  26,  126,  626,  3126,  ...
  0, -2,  -8,  -26,  -80,  -242,  ...
		

Crossrefs

Programs

  • Mathematica
    Table[Function[k, SeriesCoefficient[Sum[(-1)^(j - 1) (2 j - 1)^k x^(2 j - 1)/(1 - x^(2 j - 1)), {j, 1, n}], {x, 0, n}]][i - n], {i, 0, 12}, {n, 1, i}] // Flatten

Formula

G.f. of column k: Sum_{j>=1} (-1)^(j-1)*(2*j - 1)^k*x^(2*j-1)/(1 - x^(2*j-1)).

A321558 a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^2.

Original entry on oeis.org

1, -5, 10, -13, 26, -50, 50, -45, 91, -130, 122, -130, 170, -250, 260, -173, 290, -455, 362, -338, 500, -610, 530, -450, 651, -850, 820, -650, 842, -1300, 962, -685, 1220, -1450, 1300, -1183, 1370, -1810, 1700, -1170, 1682, -2500, 1850, -1586, 2366
Offset: 1

Views

Author

N. J. A. Sloane, Nov 23 2018

Keywords

Examples

			G.f. = x - 5*x^2 + 10*x^3 - 13*x^4 + 26*x^5 - 50*x^6 + 50*x^7 + ... - _Michael Somos_, Oct 24 2019
		

Crossrefs

Column k=2 of A322083.
Cf. A321543 - A321557, A321810 - A321836 for similar sequences.

Programs

  • Magma
    m:=50; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( (&+[(-1)^(k+1)*k^2*x^k/(1 + x^k) : k in [1..2*m]]) )); // G. C. Greubel, Nov 28 2018
    
  • Mathematica
    a[n_] := DivisorSum[n, (-1)^(# + n/#)*#^2 &]; Array[a, 50] (* Amiram Eldar, Nov 27 2018 *)
  • PARI
    apply( A321558(n)=sumdiv(n, d, (-1)^(n\d-d)*d^2), [1..30]) \\ M. F. Hasler, Nov 26 2018
    
  • Sage
    s=(sum((-1)^(k+1)*k^2*x^k/(1 + x^k)  for k in (1..50))).series(x, 30); a = s.coefficients(x, sparse=False); a[1:] # G. C. Greubel, Nov 28 2018

Formula

G.f.: Sum_{k>=1} (-1)^(k+1)*k^2*x^k/(1 + x^k). - Ilya Gutkovskiy, Nov 27 2018
G.f.: Sum_{k>=1} (-1)^(k+1)*(x^k - x^(2*k))/(1 + x^k)^3. - Michael Somos, Oct 24 2019
a(n) = -(-1)^n A328667(n). a(2*n + 1) = A078306(2*n + 1). a(2*n) = A078306(2*n) - 8*A078306(n). - Michael Somos, Oct 24 2019
From Peter Bala, Jan 29 2022: (Start)
Multiplicative with a(2^k) = - (2^(2*k+1) + 7)/3 for k >= 1 and a(p^k) = (p^(2*k+2) - 1)/(p^2 - 1) for odd prime p.
n^2 = (-1)^(n+1)*Sum_{d divides n} A067856(n/d)*a(d). (End)

A322081 Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} (-1)^(n/d+1)*d^k.

Original entry on oeis.org

1, 1, 0, 1, 1, 2, 1, 3, 4, -1, 1, 7, 10, 1, 2, 1, 15, 28, 11, 6, 0, 1, 31, 82, 55, 26, 4, 2, 1, 63, 244, 239, 126, 30, 8, -2, 1, 127, 730, 991, 626, 196, 50, 1, 3, 1, 255, 2188, 4031, 3126, 1230, 344, 43, 13, 0, 1, 511, 6562, 16255, 15626, 7564, 2402, 439, 91, 6, 2, 1, 1023, 19684, 65279, 78126, 45990, 16808, 3823, 757, 78, 12, -2
Offset: 1

Views

Author

Ilya Gutkovskiy, Nov 26 2018

Keywords

Examples

			Square array begins:
   1,  1,   1,    1,     1,     1,  ...
   0,  1,   3,    7,    15,    31,  ...
   2,  4,  10,   28,    82,   244,  ...
  -1,  1,  11,   55,   239,   991,  ...
   2,  6,  26,  126,   626,  3126,  ...
   0,  4,  30,  196,  1230,  7564,  ...
		

Crossrefs

Programs

  • Mathematica
    Table[Function[k, Sum[(-1)^(n/d + 1) d^k, {d, Divisors[n]}]][i - n], {i, 0, 12}, {n, 1, i}] // Flatten
    Table[Function[k, SeriesCoefficient[Sum[j^k x^j/(1 + x^j), {j, 1, n}], {x, 0, n}]][i - n], {i, 0, 12}, {n, 1, i}] // Flatten
  • PARI
    T(n,k)={sumdiv(n, d, (-1)^(n/d+1)*d^k)}
    for(n=1, 10, for(k=0, 8, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 26 2018

Formula

G.f. of column k: Sum_{j>=1} j^k*x^j/(1 + x^j).

A322082 Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n, n/d odd} d^k.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 1, 4, 4, 1, 1, 8, 10, 4, 2, 1, 16, 28, 16, 6, 2, 1, 32, 82, 64, 26, 8, 2, 1, 64, 244, 256, 126, 40, 8, 1, 1, 128, 730, 1024, 626, 224, 50, 8, 3, 1, 256, 2188, 4096, 3126, 1312, 344, 64, 13, 2, 1, 512, 6562, 16384, 15626, 7808, 2402, 512, 91, 12, 2, 1, 1024, 19684, 65536, 78126, 46720, 16808, 4096, 757, 104, 12, 2
Offset: 1

Views

Author

Ilya Gutkovskiy, Nov 26 2018

Keywords

Examples

			Square array begins:
  1,  1,   1,    1,     1,     1,  ...
  1,  2,   4,    8,    16,    32,  ...
  2,  4,  10,   28,    82,   244,  ...
  1,  4,  16,   64,   256,  1024,  ...
  2,  6,  26,  126,   626,  3126,  ...
  2,  8,  40,  224,  1312,  7808,  ...
		

Crossrefs

Programs

  • Mathematica
    Table[Function[k, Sum[Boole[OddQ[n/d]] d^k, {d, Divisors[n]}]][i - n], {i, 0, 12}, {n, 1, i}] // Flatten
    Table[Function[k, SeriesCoefficient[Sum[j^k x^j/(1 - x^(2 j)), {j, 1, n}], {x, 0, n}]][i - n], {i, 0, 12}, {n, 1, i}] // Flatten
  • PARI
    T(n,k)={sumdiv(n, d, if(n/d%2, d^k))}
    for(n=1, 10, for(k=0, 8, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 26 2018

Formula

G.f. of column k: Sum_{j>=1} j^k*x^j/(1 - x^(2*j)).

A322084 Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n, n/d==1 (mod 4)} d^k - Sum_{d|n, n/d==3 (mod 4)} d^k.

Original entry on oeis.org

1, 1, 1, 1, 2, 0, 1, 4, 2, 1, 1, 8, 8, 4, 2, 1, 16, 26, 16, 6, 0, 1, 32, 80, 64, 26, 4, 0, 1, 64, 242, 256, 126, 32, 6, 1, 1, 128, 728, 1024, 626, 208, 48, 8, 1, 1, 256, 2186, 4096, 3126, 1280, 342, 64, 7, 2, 1, 512, 6560, 16384, 15626, 7744, 2400, 512, 73, 12, 0, 1, 1024, 19682, 65536, 78126, 46592, 16806, 4096, 703, 104, 10, 0
Offset: 1

Views

Author

Ilya Gutkovskiy, Nov 26 2018

Keywords

Examples

			Square array begins:
  1,  1,   1,    1,     1,     1,  ...
  1,  2,   4,    8,    16,    32,  ...
  0,  2,   8,   26,    80,   242,  ...
  1,  4,  16,   64,   256,  1024,  ...
  2,  6,  26,  126,   626,  3126,  ...
  0,  4,  32,  208,  1280,  7744,  ...
		

Crossrefs

Programs

  • Mathematica
    Table[Function[k, SeriesCoefficient[Sum[j^k x^j/(1 + x^(2 j)), {j, 1, n}], {x, 0, n}]][i - n], {i, 0, 12}, {n, 1, i}] // Flatten
  • PARI
    T(n,k)={sumdiv(n, d, if(d%2, (-1)^((d-1)/2)*(n/d)^k))}
    for(n=1, 10, for(k=0, 8, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 26 2018

Formula

G.f. of column k: Sum_{j>=1} j^k*x^j/(1 + x^(2*j)).

A321564 a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^8.

Original entry on oeis.org

1, -257, 6562, -65281, 390626, -1686434, 5764802, -16711425, 43053283, -100390882, 214358882, -428373922, 815730722, -1481554114, 2563287812, -4278124289, 6975757442, -11064693731, 16983563042, -25500455906, 37828630724, -55090232674
Offset: 1

Views

Author

N. J. A. Sloane, Nov 23 2018

Keywords

Crossrefs

Column k=8 of A322083.
Cf. A321543 - A321565, A321807 - A321836 for similar sequences.

Programs

  • Mathematica
    a[n_] := DivisorSum[n, (-1)^(# + n/#)*#^8 &]; Array[a, 25] (* Amiram Eldar, Nov 22 2022 *)
  • PARI
    apply( A321564(n)=sumdiv(n, d, (-1)^(n\d-d)*d^8), [1..30]) \\ M. F. Hasler, Nov 26 2018

Formula

G.f.: Sum_{k>=1} (-1)^(k+1)*k^8*x^k/(1 + x^k). - Ilya Gutkovskiy, Dec 22 2018
Multiplicative with a(2^e) = -(127*2^(8*e+1) + 511)/255, and a(p^e) = (p^(8*e+8) - 1)/(p^8 - 1) for p > 2. - Amiram Eldar, Nov 22 2022

A321808 a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^11.

Original entry on oeis.org

1, -2049, 177148, -4192257, 48828126, -362976252, 1977326744, -8585738241, 31381236757, -100048830174, 285311670612, -742649943036, 1792160394038, -4051542498456, 8649804864648, -17583591913473, 34271896307634, -64300154115093
Offset: 1

Views

Author

N. J. A. Sloane, Nov 23 2018

Keywords

Crossrefs

Column k=11 of A322083.
Cf. A321543 - A321565, A321807 - A321836 for similar sequences.

Programs

  • Mathematica
    a[n_] := DivisorSum[n, (-1)^(# + n/#)*#^11 &]; Array[a, 50] (* Amiram Eldar, Nov 22 2022 *)
  • PARI
    apply( A321808(n)=sumdiv(n, d, (-1)^(n\d-d)*d^11), [1..30]) \\ M. F. Hasler, Nov 26 2018

Formula

G.f.: Sum_{k>=1} (-1)^(k+1)*k^11*x^k/(1 + x^k). - Ilya Gutkovskiy, Dec 22 2018
Multiplicative with a(2^e) = -3*(341*2^(11*e+1) + 1365)/2047, and a(p^e) = (p^(11*e+11) - 1)/(p^11 - 1) for p > 2. - Amiram Eldar, Nov 22 2022

A321559 a(n) = Sum_{d divides n} (-1)^(d + n/d) * d^3.

Original entry on oeis.org

1, -9, 28, -57, 126, -252, 344, -441, 757, -1134, 1332, -1596, 2198, -3096, 3528, -3513, 4914, -6813, 6860, -7182, 9632, -11988, 12168, -12348, 15751, -19782, 20440, -19608, 24390, -31752, 29792, -28089, 37296, -44226, 43344, -43149, 50654
Offset: 1

Views

Author

N. J. A. Sloane, Nov 23 2018

Keywords

Crossrefs

Column k=3 of A322083.
Cf. A321543 - A321565, A321807 - A321836 for similar sequences.

Programs

  • Magma
    m:=50; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( (&+[(-1)^(k+1)*k^3*x^k/(1 + x^k) : k in [1..2*m]]) )); // G. C. Greubel, Nov 28 2018
    
  • Mathematica
    a[n_] := DivisorSum[n, (-1)^(# + n/#)*#^3 &]; Array[a, 50] (* Amiram Eldar, Nov 27 2018 *)
  • PARI
    apply( A321559(n)=sumdiv(n, d, (-1)^(n\d-d)*d^3), [1..30]) \\ M. F. Hasler, Nov 26 2018
    
  • Sage
    s=(sum((-1)^(k+1)*k^3*x^k/(1 + x^k)  for k in (1..50))).series(x, 50); a = s.coefficients(x, sparse=False); a[1:] # G. C. Greubel, Nov 28 2018

Formula

G.f.: Sum_{k>=1} (-1)^(k+1)*k^3*x^k/(1 + x^k). - Ilya Gutkovskiy, Nov 27 2018
From Peter Bala, Jan 29 2022: (Start)
Multiplicative with a(2^k) = - 3*(2^(3*k+1) + 5)/7 for k >= 1 and a(p^k) = (p^(3*k+3) - 1)/(p^3 - 1) for odd prime p.
n^3 = (-1)^(n+1)*Sum_{d divides n} A067856(n/d)*a(d). (End)
Showing 1-10 of 15 results. Next