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

A143951 Number of Dyck paths such that the area between the x-axis and the path is n.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 4, 6, 9, 14, 21, 31, 47, 71, 107, 161, 243, 367, 553, 834, 1258, 1898, 2863, 4318, 6514, 9827, 14824, 22361, 33732, 50886, 76762, 115796, 174680, 263509, 397508, 599647, 904579, 1364576, 2058489, 3105269, 4684359, 7066449, 10659877, 16080632, 24257950, 36593598, 55202165, 83273553, 125619799, 189499952
Offset: 0

Views

Author

Emeric Deutsch, Oct 09 2008

Keywords

Comments

Column sums of A129182.

Examples

			a(5)=3 because we have UDUUDD, UUDDUD and UDUDUDUDUD, where U=(1,1) and D=(1,-1).
From _Peter Bala_, Dec 26 2012: (Start)
F(1/10) = sum {n >= 0} a(n)/10^n has the simple continued fraction expansion 1 + 1/(8 + 1/(1 + 1/(98 + 1/(1 + 1/(998 + 1/(1 + ...)))))).
F(-1/10) = sum {n >= 0} (-1)^n*a(n)/10^n has the simple continued fraction expansion 1/(1 + 1/(10 + 1/(100 + 1/(1000 + ...)))).
(End)

Links

Crossrefs

Cf. A129182, A291874 (convolution inverse).
Cf. A005169, A111317, A224704.

Programs

  • Maple
    g:=1/(1-x/(1-x^3/(1-x^5/(1-x^7/(1-x^9/(1-x^11/(1-x^13/(1-x^15)))))))): gser:= series(g,x=0,45): seq(coeff(gser,x,n),n=0..44);
# second Maple program:
b:= proc(x, y, k) option remember;
      `if`(y<0 or y>x or k<0 or k>x^2/2-(y-x)^2/4, 0,
      `if`(x=0, 1, b(x-1, y-1, k-y+1/2) +b(x-1, y+1, k-y-1/2)))
    end:
a:= n-> add(b(2*n-4*t, 0, n), t=0..n/2):
seq(a(n), n=0..50);  # Alois P. Heinz, Aug 24 2018
  • Mathematica
    terms = 50; CoefficientList[1/(1+ContinuedFractionK[-x^(2i-1), 1, {i, 1, Sqrt[terms]//Ceiling}]) + O[x]^terms, x] (* Jean-François Alcover, Jul 11 2018 *)
  • PARI
    N=66; q = 'q +O('q^N);
G(k) = if(k>N, 1, 1 - q^(k+1) / G(k+2) );
gf = 1 / G(0);
Vec(gf) \\ Joerg Arndt, Jul 06 2013

Formula

G.f.: 1/(1 - x/(1 - x^3/(1 - x^5/(1 - x^7/(1 - x^9/(1 - ...
Derivation: the g.f. G(x,z) of Dyck paths, where x marks area and z marks semilength, satisfies G(x,z)=1+x*z*G(x,z)*G(x,x^2*z). Set z=1.
From Peter Bala, Dec 26 2012: (Start)
Let F(x) denote the o.g.f. of this sequence. For positive integer n >= 3, the real number F(1/n) has the simple continued fraction expansion 1 + 1/(n-2 + 1/(1 + 1/(n^2-2 + 1/(1 + 1/(n^3-2 + 1/(1 + ...)))))).
For n >= 1, F(-1/n) has the simple continued fraction expansion
1/(1 + 1/(n + 1/(n^2 + 1/(n^3 + ...)))). Examples are given below. Cf. A005169 and A111317.
(End)
G.f.: A(x) = 1/(1 - x/(1-x + x/(1+x^2 + x^4/(1-x^3 - x^2/(1+x^4 - x^7/(1-x^5 + x^3/(1+x^6 + x^10/(1-x^7 - x^4/(1+x^8 - x^13/(1-x^9 + x^5/(1+x^10 + x^16/(1 + ...)))))))))))), a continued fraction. - Paul D. Hanna, Aug 08 2016
a(n) ~ c / r^n, where r = 0.66290148514884371255690407749133031115536799774051... and c = 0.337761150388539773466092171229604432776662930886727976914... . - Vaclav Kotesovec, Feb 17 2017, corrected Nov 04 2021
From Peter Bala, Jul 04 2019: (Start)
O.g.f. as a ratio of q-series: N(q)/D(q), where N(q) = Sum_{n >= 0} (-1)^n*q^(2*n^2+n)/( (1-q^2)*(1-q^4)*...*(1-q^(2*n)) ) and D(q) = Sum_{n >= 0} (-1)^n*q^(2*n^2-n)/( (1-q^2)*(1-q^4)*...*(1-q^(2*n)) ). Cf. A224704.
D(q) has its least positive (and simple) real zero at x = 0.66290 14851 48843 71255 69040 ....
a(n) ~ c*d^n, where d = 1/x = 1.5085197761707628638804960 ... and c = - N(x)/(x*D'(x)) = 0.3377611503885397734660921 ... (the prime indicates differentiation w.r.t. q). (End)

Extensions

b-file corrected and extended by Alois P. Heinz, Aug 24 2018

A227310 G.f.: 1/G(0) where G(k) = 1 + (-q)^(k+1) / (1 - (-q)^(k+1)/G(k+1) ).

Original entry on oeis.org

1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 2, 1, 1, 3, 2, 3, 4, 4, 6, 7, 8, 11, 13, 16, 20, 24, 31, 37, 46, 58, 70, 88, 108, 133, 167, 204, 252, 315, 386, 479, 594, 731, 909, 1122, 1386, 1720, 2124, 2628, 3254, 4022, 4980, 6160, 7618, 9432, 11665, 14433, 17860, 22093, 27341, 33824, 41847, 51785, 64065, 79267
Offset: 0

Views

Author

Joerg Arndt, Jul 06 2013

Keywords

Comments

Number of rough sandpiles: 1-dimensional sandpiles (see A186085) with n grains without flat steps (no two successive parts of the corresponding composition equal), see example. - Joerg Arndt, Mar 08 2014
The sequence of such sandpiles by base length starts (n>=0) 1, 1, 0, 1, 0, 2, 0, 5, 0, 14, 0, 42, 0, ... (A097331, essentially A000108 with interlaced zeros). This is a consequence of the obvious connection to Dyck paths, see example. - Joerg Arndt, Mar 09 2014
a(n>=1) are the Dyck paths with area n between the x-axis and the path which return to the x-axis only once (at their end), whereas A143951 includes paths with intercalated touches of the x-axis. - R. J. Mathar, Aug 22 2018

Examples

			From _Joerg Arndt_, Mar 08 2014: (Start)
The a(21) = 7 rough sandpiles are:
:
:   1:      [ 1 2 1 2 1 2 1 2 1 2 3 2 1 ]  (composition)
:
:           o
:  o o o o ooo
: ooooooooooooo  (rendering of sandpile)
:
:
:   2:      [ 1 2 1 2 1 2 1 2 3 2 1 2 1 ]
:
:         o
:  o o o ooo o
: ooooooooooooo
:
:
:   3:      [ 1 2 1 2 1 2 3 2 1 2 1 2 1 ]
:
:       o
:  o o ooo o o
: ooooooooooooo
:
:
:   4:      [ 1 2 1 2 3 2 1 2 1 2 1 2 1 ]
:
:     o
:  o ooo o o o
: ooooooooooooo
:
:
:   5:      [ 1 2 3 2 1 2 1 2 1 2 1 2 1 ]
:
:   o
:  ooo o o o o
: ooooooooooooo
:
:
:   6:      [ 1 2 3 2 3 4 3 2 1 ]
:
:      o
:   o ooo
:  ooooooo
: ooooooooo
:
:
:   7:      [ 1 2 3 4 3 2 3 2 1 ]
:
:    o
:   ooo o
:  ooooooo
: ooooooooo
(End)
From _Joerg Arndt_, Mar 09 2014: (Start)
The A097331(9) = 14 such sandpiles with base length 9 are:
01:  [ 1 2 1 2 1 2 1 2 1 ]
02:  [ 1 2 1 2 1 2 3 2 1 ]
03:  [ 1 2 1 2 3 2 3 2 1 ]
04:  [ 1 2 1 2 3 2 1 2 1 ]
05:  [ 1 2 1 2 3 4 3 2 1 ]
06:  [ 1 2 3 2 1 2 3 2 1 ]
07:  [ 1 2 3 2 1 2 1 2 1 ]
08:  [ 1 2 3 2 3 2 1 2 1 ]
09:  [ 1 2 3 2 3 2 3 2 1 ]
10:  [ 1 2 3 4 3 2 1 2 1 ]
11:  [ 1 2 3 2 3 4 3 2 1 ]
12:  [ 1 2 3 4 3 2 3 2 1 ]
13:  [ 1 2 3 4 3 4 3 2 1 ]
14:  [ 1 2 3 4 5 4 3 2 1 ]
(End)

Links

Crossrefs

Cf. A049346 (g.f.: 1 - 1/G(0), where G(k)= 1 + q^(k+1) / (1 - q^(k+1)/G(k+1) ) ).
Cf. A226728 (g.f.: 1/G(0), where G(k) = 1 + q^(k+1) / (1 - q^(k+1)/G(k+2) ) ).
Cf. A226729 (g.f.: 1/G(0), where G(k) = 1 - q^(k+1) / (1 - q^(k+1)/G(k+2) ) ).
Cf. A006958 (g.f.: 1/G(0), where G(k) = 1 - q^(k+1) / (1 - q^(k+1)/G(k+1) ) ).
Cf. A227309 (g.f.: 1/G(0), where G(k) = 1 - q^(k+1) / (1 - q^(k+2)/G(k+1) ) ).
Cf. A173258, A291874.

Programs

  • PARI
    N = 66;  q = 'q + O('q^N);
G(k) = if(k>N, 1, 1 + (-q)^(k+1) / (1 - (-q)^(k+1) / G(k+1) ) );
gf = 1 / G(0);
Vec(gf)
  • PARI
    N = 66;  q = 'q + O('q^N);
F(q,y,k) = if(k>N, 1, 1/(1 - y*q^2 * F(q, q^2*y, k+1) ) );
Vec( 1 + q * F(q,q,0) ) \\ Joerg Arndt, Mar 09 2014

Formula

a(0) = 1 and a(n) = abs(A049346(n)) for n>=1.
G.f.: 1/ (1-q/(1+q/ (1+q^2/(1-q^2/ (1-q^3/(1+q^3/ (1+q^4/(1-q^4/ (1-q^5/(1+q^5/ (1+-...) )) )) )) )) )).
G.f.: 1 + q * F(q,q) where F(q,y) = 1/(1 - y * q^2 * F(q, q^2*y) ); cf. A005169 and p. 841 of the Odlyzko/Wilf reference; 1/(1 - q * F(q,q)) is the g.f. of A143951. - Joerg Arndt, Mar 09 2014
G.f.: 1 + q/(1 - q^3/(1 - q^5/(1 - q^7/ (...)))) (from formulas above). - Joerg Arndt, Mar 09 2014
G.f.: F(x, x^2) where F(x,y) is the g.f. of A239927. - Joerg Arndt, Mar 29 2014
a(n) ~ c * d^n, where d = 1.23729141259673487395949649334678514763130846902468... and c = 0.0773368373684184197215007198148835507944051447907... - Vaclav Kotesovec, Sep 05 2017
G.f.: A(x) = 2 -1/A143951(x). - R. J. Mathar, Aug 23 2018
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.