login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026725 Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1<=k<=n-1, T(n,k)=T(n-1,k-1)+T(n-2,k-1)+T(n-1,k) if n is odd and k=(n-1)/2, else T(n,k)=T(n-1,k-1)+T(n-1,k). 26
1, 1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 5, 7, 4, 1, 1, 6, 16, 11, 5, 1, 1, 7, 22, 27, 16, 6, 1, 1, 8, 29, 65, 43, 22, 7, 1, 1, 9, 37, 94, 108, 65, 29, 8, 1, 1, 10, 46, 131, 267, 173, 94, 37, 9, 1, 1, 11, 56, 177, 398, 440, 267, 131, 46, 10, 1, 1, 12, 67, 233 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

T(n+2,n) = A134869(n+1). - Philippe Deléham, Feb 01 2014

LINKS

Table of n, a(n) for n=1..70.

Rob Arthan, Comments on A026674, A026725, A026670

FORMULA

T(n, k) = number of paths from (0, 0) to (n-k, k) in directed graph having vertices (i, j) and edges (i, j)-to-(i+1, j) and (i, j)-to-(i, j+1) for i, j >= 0 and edges (i, i+1)-to-(i+1, i+2) for i >= 0.

Comment from Rick L. Shepherd, Aug 05 2002: Probably this should be changed to "and edges (i+1, i)-to-(i+2, i+1) for i >= 0."

EXAMPLE

Triangle begins:

1

1  1

1  2  1

1  4  3   1

1  5  7   4   1

1  6 16  11   5    1

1  7 22  27  16    6   1

1  8 29  65  43   22   7   1

1  9 37  94 108   65  29   8   1

1 10 46 131 267  173  94  37   9  1

1 11 56 177 398  440 267 131  46 10  1

1 12 67 233 575 1105 707 398 177 56 11 1

... - Philippe Deléham, Feb 01 2014

CROSSREFS

Cf. A026674.

Sequence in context: A217874 A229118 A320796 * A026758 A130523 A034363

Adjacent sequences:  A026722 A026723 A026724 * A026726 A026727 A026728

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 02:56 EST 2018. Contains 317252 sequences. (Running on oeis4.)