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.

A060047 Triangle of generalized sum of divisors function, read by rows.

Original entry on oeis.org

1, 2, 4, 1, 4, 2, 6, 4, 8, 8, 8, 14, 8, 1, 18, 13, 2, 28, 12, 4, 40, 12, 8, 52, 16, 14, 70, 14, 24, 88, 16, 40, 104, 24, 1, 56, 140, 16, 2, 84, 168, 18, 4, 122, 196, 26, 8, 168, 240, 20, 14, 232, 278, 24, 24, 312, 320, 32, 40, 408, 380, 24, 64, 528, 440, 24, 100, 672, 504
Offset: 1

Views

Author

N. J. A. Sloane, Mar 19 2001

Keywords

Comments

Lengths of rows are 1 1 1 2 2 2 2 2 3 3 3 3 3 3 3 ... (A000196).

Examples

			Triangle turned on its side begins:
  1  2  4  4  6  8  8  8 13 12 12 ...
           1  2  4  8 14 18 28 40 ...
                          1  2  4 ...
For example, T(6,1) = 8, T(6,2) = 4.
		

Crossrefs

Formula

T(n, k) = sum of s_1*s_2*...*s_k where s_1, s_2, ..., s_k are such that s_1*(2*m_1-1) + s_2*(2*m_2-1) + ... + s_k*(2*m_k-1) = n and the sum is over all such k-partitions of n.
G.f. for k-th diagonal (the k-th row of the sideways triangle shown in the example): Sum_{ m_1 < m_2 < ... < m_k} q^(2*m_1+2*m_2+...+2*m_k-k)/((1-q^{2*m_1-1})*(1-q^{2*m_2-1})*...*(1-q^{2*m_k-1}))^2 = Sum_n T(n, k)*q^n.
G.f. for k-th diagonal: (-1)^k * (1/k) * ( Sum_{j>=k} (-1)^j * j * binomial(j+k-1,2*k-1) * q^(j^2) ) / ( 1 + 2 * Sum_{j>=1} (-q)^(j^2) ). - Seiichi Manyama, Sep 15 2023

Extensions

More terms from Naohiro Nomoto, Jan 24 2002

A365664 Expansion of Sum_{0

Original entry on oeis.org

1, 3, 9, 22, 51, 97, 188, 330, 568, 918, 1452, 2233, 3344, 4884, 7004, 9856, 13653, 18699, 25080, 33462, 43918, 57304, 73668, 94482, 119262, 150285, 187231, 232560, 285660, 350746, 425627, 516477, 620731, 745503, 887796, 1056669, 1247521, 1472460, 1726054, 2021327
Offset: 10

Views

Author

Seiichi Manyama, Sep 15 2023

Keywords

Comments

Number of partitions of n with four designated summands. For example: a(11) = 3 because there are three partitions of 11 with four designated summands: [5'+ 3'+ 2'+ 1'], [4'+ 3'+ 2'+ 1'+ 1], [4'+ 3'+ 2'+ 1 + 1']. - Omar E. Pol, Jul 26 2025

Crossrefs

A diagonal of A060043.
Column k=4 of A385001.

Programs

  • Mathematica
    a[n_] := Module[{d = DivisorSigma[{1, 3, 5, 7}, n]}, (5*d[[4]] - (126*n-441)*d[[3]] + (756*n^2-4410*n+4935)*d[[2]] - (840*n^3-5880*n^2+9870*n-3229)*d[[1]])/967680]; Array[a, 40, 10] (* Amiram Eldar, Jan 07 2025 *)
  • PARI
    a(n) = (5*sigma(n, 7)-(126*n-441)*sigma(n, 5)+(756*n^2-4410*n+4935)*sigma(n, 3)-(840*n^3-5880*n^2+9870*n-3229)*sigma(n))/967680; \\ Seiichi Manyama, Jul 24 2024

Formula

G.f.: (1/9) * ( Sum_{k>=4} (-1)^k * (2*k+1) * binomial(k+4,8) * q^(k*(k+1)/2) ) / ( Sum_{k>=0} (-1)^k * (2*k+1) * q^(k*(k+1)/2) ).
a(n) = (5*sigma_7(n) - (126*n-441)*sigma_5(n) + (756*n^2-4410*n+4935)*sigma_3(n) - (840*n^3-5880*n^2+9870*n-3229)*sigma(n))/967680. - Seiichi Manyama, Jul 24 2024
Sum_{k=1..n} a(k) ~ Pi^8 * n^8 / (8!*9!). - Vaclav Kotesovec, Aug 01 2025

A365667 Expansion of Sum_{0

Original entry on oeis.org

1, 2, 4, 8, 14, 24, 40, 64, 100, 154, 232, 332, 480, 680, 944, 1304, 1774, 2384, 3180, 4200, 5488, 7120, 9160, 11680, 14869, 18740, 23468, 29280, 36278, 44720, 54904, 67040, 81464, 98658, 118936, 142792, 170902, 203760, 242120, 286624, 338366, 398160, 467148
Offset: 25

Views

Author

Seiichi Manyama, Sep 15 2023

Keywords

Crossrefs

A diagonal of A060047.
Cf. A015128.

Programs

  • Mathematica
    nmax = 80; Drop[CoefficientList[Series[-1/5 * Sum[(-1)^k*k*Binomial[k + 4, 9]*x^(k^2), {k, 5, nmax}]/(1 + 2*Sum[(-x)^(k^2), {k, 1, nmax}]), {x, 0, nmax}], x], 25] (* Vaclav Kotesovec, Jul 30 2025 *)

Formula

G.f.: -(1/5) * ( Sum_{k>=5} (-1)^k * k * binomial(k+4,9) * q^(k^2) ) / ( 1 + 2 * Sum_{k>=1} (-q)^(k^2) ).
Showing 1-3 of 3 results.