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.

Previous Showing 11-13 of 13 results.

A233759 Bisection of A006950 (the odd part).

Original entry on oeis.org

1, 2, 4, 7, 13, 21, 35, 55, 86, 130, 196, 287, 420, 602, 858, 1206, 1687, 2331, 3206, 4368, 5922, 7967, 10670, 14193, 18803, 24766, 32490, 42411, 55159, 71416, 92152, 118434, 151725, 193676, 246491, 312677, 395537, 498852, 627509, 787171, 985043, 1229494
Offset: 1

Views

Author

Omar E. Pol, Jan 11 2014

Keywords

Comments

See Zaletel-Mong paper, page 14, FIG. 11: C2a is A233758, C2b is this sequence, C2c is A015128.

Crossrefs

Programs

  • Mathematica
    b[n_, i_] := b[n, i] = If[n == 0, 1, If[i < 1, 0, b[n, i - 1] + If[i > n, 0, b[n - i, i - Mod[i, 2]]]]];
    a[n_] := b[2 n - 1, 2 n - 1];
    Table[a[n], {n, 1, 42}] (* Jean-François Alcover, Dec 11 2018, after Alois P. Heinz in A006950 *)

A255001 Number of partitions of 4n into distinct parts with equal sums of odd and even parts.

Original entry on oeis.org

1, 0, 1, 2, 4, 6, 12, 15, 30, 40, 70, 96, 165, 216, 352, 486, 736, 988, 1518, 1998, 2944, 3952, 5607, 7488, 10614, 13916, 19305, 25536, 34854, 45568, 61864, 80240, 107640, 139776, 184832, 238680, 314628, 402800, 526176, 673652, 872592, 1110060, 1431704
Offset: 0

Views

Author

Alois P. Heinz, Feb 11 2015

Keywords

Examples

			a(0) = 1: [], the empty partition.
a(1) = 0.
a(2) = 1: [4,3,1].
a(3) = 2: [6,5,1], [5,4,2,1].
a(4) = 4: [8,7,1], [8,5,3], [7,6,2,1], [6,5,3,2].
		

Crossrefs

Programs

  • Maple
    g:= proc(n, i) option remember; `if`(i*(i+1)/2n, 0, g(n-i, i-1))))
        end:
    b:= proc(n, i) option remember; `if`(n=0, 1,
         `if`(i<1, 0, b(n, i-2)+`if`(i>n, 0, b(n-i, i-2))))
        end:
    a:= n-> g(n$2)*b(2*n, 2*n-1):
    seq(a(n), n=0..50);
  • Mathematica
    g[n_, i_] := g[n, i] = If[i(i+1)/2 < n, 0, If[n == 0, 1, g[n, i - 1] + If[i > n, 0, g[n - i, i - 1]]]];
    b[n_, i_] := b[n, i] = If[n == 0, 1, If[i < 1, 0, b[n, i - 2] + If[i > n, 0, b[n - i, i - 2]]]];
    a[n_] := g[n, n] b[2n, 2n-1];
    a /@ Range[0, 50] (* Jean-François Alcover, Dec 11 2020, after Alois P. Heinz *)

Formula

a(n) = A000009(n) * A069910(n) = A000009(n) * A000700(2n).
a(n) ~ exp(2*Pi*sqrt(n/3)) / (16*sqrt(6)*n^(3/2)). - Vaclav Kotesovec, Dec 11 2020

A366104 G.f. ( Chi(sqrt(x))^4 + Chi(-sqrt(x))^4 )/2, where Chi(x) = Product_{k >= 0} 1 + x^(2*k+1) is the g.f. of A000700.

Original entry on oeis.org

1, 6, 17, 38, 84, 172, 325, 594, 1049, 1796, 3005, 4912, 7877, 12430, 19309, 29580, 44766, 66978, 99150, 145374, 211242, 304382, 435194, 617674, 870651, 1219352, 1697283, 2348888, 3232919, 4426546, 6030872, 8177986, 11039633, 14838518, 19862613, 26482878, 35175989, 46552818, 61393694
Offset: 0

Views

Author

Peter Bala, Sep 29 2023

Keywords

Comments

Compare with A224916 with g.f. ( Chi(sqrt(x))^4 - Chi(-sqrt(x))^4 )/(8*sqrt(x)),
A069910 with g.f. ( Chi(sqrt(x)) + Chi(-sqrt(x)) )/2,
A069911 with g.f. ( Chi(sqrt(x)) - Chi(-sqrt(x)) )/2,
A226622 with g.f. ( Chi(sqrt(x))^2 + Chi(-sqrt(x))^2 )/2 and
A226635 with g.f. ( Chi(sqrt(x))^2 - Chi(-sqrt(x))^2 )/(4*sqrt(x)),
Jacobi's "aequatio identica satis abstrusa" is the identity ( Chi(sqrt(x))^8 - Chi(-sqrt(x))^8 )/(16*sqrt(x)) = Product_{k >= 1} (1 + x^k)^8.

Crossrefs

Programs

  • Maple
    with(QDifferenceEquations):
     seq(coeff((1/2)*expand(QPochhammer(-q,q^2,40)^4 + QPochhammer(q,q^2,40)^4), q, 2*n), n = 0..40);
    #alternative program
    seq(coeff(expand(QPochhammer(-q^2, q^2, 20)^2 * QPochhammer(-q, q^2, 20)^6), q, n), n = 0..40);
  • Mathematica
    nmax = 40; CoefficientList[Series[Product[(1 + x^(2*k))^2 * (1 + x^(2*k-1))^6, {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Jun 29 2025 *)

Formula

G.f.: Product_{k >= 1} (1 + x^(2*k))^2*(1 + x^(2*k-1))^6.
G.f.: x^(1/12) * eta(x^2)^10 * eta(x^4)^2 / ( eta(x) * eta(x^4) )^6.
a(n) ~ exp(2*Pi*sqrt(n/3)) / (4 * 3^(1/4) * n^(3/4)). - Vaclav Kotesovec, Jun 29 2025
Previous Showing 11-13 of 13 results.