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.

A264686 Expansion of Product_{k>=1} (1 + 2*x^k)/(1 - x^k).

Original entry on oeis.org

1, 3, 6, 15, 27, 51, 93, 159, 264, 432, 696, 1086, 1683, 2553, 3837, 5700, 8367, 12147, 17505, 24972, 35361, 49728, 69402, 96243, 132657, 181782, 247692, 335838, 453042, 608289, 813102, 1082256, 1434519, 1894215, 2491644, 3265869, 4265973, 5553771, 7207167
Offset: 0

Views

Author

Vaclav Kotesovec, Nov 21 2015

Keywords

Comments

Convolution of A000041 and A032302.

Crossrefs

Programs

  • Maple
    b:= proc(n, i) option remember; `if`(i*(i+1)/2n, 0, 2*b(n-i, i-1))))
        end:
    a:= n-> add(b(i$2)*combinat[numbpart](n-i), i=0..n):
    seq(a(n), n=0..60);  # Alois P. Heinz, Dec 22 2017
  • Mathematica
    nmax = 40; CoefficientList[Series[Product[(1 + 2*x^k)/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x]
  • PARI
    { my(n=40); Vec(prod(k=1, n, 3/(1-x^k) - 2 + O(x*x^n))) } \\ Andrew Howroyd, Dec 22 2017

Formula

a(n) ~ sqrt(c) * exp(sqrt(2*c*n)) / (4*Pi*sqrt(3)*n), where c = 2*Pi^2/3 + log(2)^2 + 2*polylog(2, -1/2) = 6.163360867463814765670634381079217086937812673723341... . - Vaclav Kotesovec, Jan 04 2016

A321884 Number A(n,k) of partitions of n into colored blocks of equal parts with colors from a set of size k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 4, 3, 0, 1, 4, 6, 8, 5, 0, 1, 5, 8, 15, 14, 7, 0, 1, 6, 10, 24, 27, 24, 11, 0, 1, 7, 12, 35, 44, 51, 40, 15, 0, 1, 8, 14, 48, 65, 88, 93, 64, 22, 0, 1, 9, 16, 63, 90, 135, 176, 159, 100, 30, 0, 1, 10, 18, 80, 119, 192, 295, 312, 264, 154, 42, 0
Offset: 0

Views

Author

Alois P. Heinz, Aug 27 2019

Keywords

Examples

			A(3,2) = 8: 3a, 3b, 2a1a, 2a1b, 2b1a, 2b1b, 111a, 111b.
Square array A(n,k) begins:
  1,  1,   1,   1,   1,   1,    1,    1,    1, ...
  0,  1,   2,   3,   4,   5,    6,    7,    8, ...
  0,  2,   4,   6,   8,  10,   12,   14,   16, ...
  0,  3,   8,  15,  24,  35,   48,   63,   80, ...
  0,  5,  14,  27,  44,  65,   90,  119,  152, ...
  0,  7,  24,  51,  88, 135,  192,  259,  336, ...
  0, 11,  40,  93, 176, 295,  456,  665,  928, ...
  0, 15,  64, 159, 312, 535,  840, 1239, 1744, ...
  0, 22, 100, 264, 544, 970, 1572, 2380, 3424, ...
		

Crossrefs

Columns k=0-4 give: A000007, A000041, A015128, A264686, A266821.
Main diagonal gives A321880.

Programs

  • Maple
    b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0, add(
          (t-> b(t, min(t, i-1), k))(n-i*j), j=1..n/i)*k+b(n, i-1, k)))
        end:
    A:= (n, k)-> b(n$2, k):
    seq(seq(A(n, d-n), n=0..d), d=0..14);
  • Mathematica
    b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i < 1, 0, Sum[Function[t, b[t, Min[t, i - 1], k]][n - i j], {j, 1, n/i}] k + b[n, i - 1, k]]];
    A[n_, k_] := b[n, n, k];
    Table[A[n, d - n], {d, 0, 14}, {n, 0, d}] // Flatten (* Jean-François Alcover, Apr 30 2020, after Alois P. Heinz *)

Formula

G.f. of column k: Product_{j>=1} (1+(k-1)*x^j)/(1-x^j).
A(n,k) = Sum_{i=0..floor((sqrt(1+8*k)-1)/2)} k!/(k-i)! * A321878(n,i).

A268499 Expansion of Product_{k>=1} ((1 + 3*x^k) / (1 + x^k)).

Original entry on oeis.org

1, 2, 0, 8, -2, 8, 16, 8, 8, 10, 80, -8, 72, -24, 144, 128, 134, 40, 224, 120, 232, 688, 176, 696, 32, 1194, -96, 1840, 1144, 2248, 288, 2968, 800, 4160, 752, 5104, 6438, 4984, 5104, 5488, 10960, 4856, 14080, 3480, 24408, 15448, 26832, 7080, 42120, 11178
Offset: 0

Views

Author

Vaclav Kotesovec, Feb 06 2016

Keywords

Comments

In general, for m > 0, if g.f. = Product_{k>=1} ((1 + m*x^k) / (1 + x^k)) then a(n) ~ c^(1/4) * exp(sqrt(c*n)) / (2*sqrt((m+1)*Pi) * n^(3/4)), where c = Pi^2/3 + 2*log(m)^2 + 4*polylog(2, -1/m).

Crossrefs

Programs

  • Mathematica
    nmax = 100; CoefficientList[Series[Product[(1+3*x^k)/(1+x^k), {k, 1, nmax}], {x, 0, nmax}], x]

Formula

a(n) ~ c^(1/4) * exp(sqrt(c*n)) / (4*sqrt(Pi)*n^(3/4)), where c = Pi^2/3 + 2*log(3)^2 + 4*polylog(2, -1/3) = 4.467633549370382939364... .
Showing 1-3 of 3 results.