3,2

a(n-5) = number of n-th generation vertices in the tree of sequences with unit increase labeled by 6 (cf. Zoran Sunik reference) - Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 07 2003

Number of lattice paths from (0,0) to (n,n) with steps E=(1,0) and N=(0,1) which touch but do not cross the line x-y=3. Example: For n=3 there is only one path EEENNN. - Herbert Kociemba (kociemba(AT)t-online.de), May 24 2004

Number of standard tableaux of shape (n+3,n-3). - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 30 2004

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

A. Papoulis, A new method of inversion of the Laplace transform, Quart. Applied Math. 14 (1956), 405ff.

J. Riordan, The distribution of crossings of chords joining pairs of 2n points on a circle, Math. Comp., 29 (1975), 215-222.

V. E. Hoggatt, Jr. and M. Bicknell, Catalan and related sequences arising from inverses of Pascal's triangle matrices, Fib. Quart., 14 (1976), 395-405.

Zoran Sunik, Self describing sequences and the Catalan family tree, Elect. J. Combin., 10 (No. 1, 2003).

R. K. Guy, Catwalks, Sandsteps and Pascal Pyramids, J. Integer Seqs., Vol. 3 (2000), #00.1.6

Expansion of x^3*C^7, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108 . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Feb 03 2004

First differences are in A026014.

A diagonal of any of the essentially equivalent arrays A009766, A030237, A033184, A059365, A099039, A106566, A130020, A047072.

Cf. A000108 A000245 A002057 A000344 A003517 A000588 A003518 A003519 A001392.

Sequence in context: A121163 A094825 A022635 this_sequence A005285 A006095 A005003

Adjacent sequences: A000585 A000586 A000587 this_sequence A000589 A000590 A000591

nonn,easy

N. J. A. Sloane (njas(AT)research.att.com).