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-11 of 11 results.

A335768 a(n) is the number of odd-balanced unimodal sequences of weight 2n+2.

Original entry on oeis.org

1, 2, 5, 9, 16, 29, 48, 77, 123, 191, 290, 436, 643, 936, 1352, 1927, 2720, 3810, 5287, 7282, 9965, 13539, 18280, 24545, 32769, 43519, 57522, 75667, 99092, 129237, 167862, 217192, 280003, 359695, 460513, 587702
Offset: 0

Views

Author

Jeremy Lovejoy, Jun 21 2020

Keywords

Comments

A unimodal sequence is odd-balanced if: (i) the peak is even and unique, (ii) even parts to the left of the peak are distinct, (iii) even parts to the right of the peak are distinct, (iv) odd parts to the left of the peak are identical to the odd parts to the right of the peak.

Examples

			a(4) = 16, the relevant odd-balanced unimodal sequences being [10], [1,8,1], [8,2], [2,8], [1,1,6,1,1], [2,6,2], [4,6], [6,4], [1,6,2,1], [1,2,6,1], [1,1,1,4,1,1,1], [1,2,4,2,1], [1,1,2,4,1,1], [1,1,4,2,1,1], [3,4,3], [1,1,1,1,2,1,1,1,1].
		

Crossrefs

Programs

  • PARI
    my(N=44, q='q+O('q^N)); Vec( 1/(1-q) + sum(n=1, N, q^n * prod(k=1,n, (1+q^k)^2) / prod(k=1,n+1, 1-q^(2*k-1)) ) ) \\ Joerg Arndt, Jun 22 2020

Formula

G.f.: 1/(1-q) + Sum_{n>=1} q^n*(Product_{k=1..n} (1+q^k)^2)/(Product_{k=1..n+1} (1-q^(2*k-1))).
Previous Showing 11-11 of 11 results.