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.

A146207 Number of paths of the simple random walk on condition that the [n/2]th ordered value S_([n/2]) of the partial sums S_0=0, S_1,...,S_n, n odd (n=15 and S_(7) in this example), is equal to k, [ -n/2]-1<=k<=[n/2].

Table of values

n a(n)
0 35
1 70
2 336
3 602
4 1456
5 2310
6 3760
7 5210
8 6435
9 5210
10 3270
11 2310
12 966
13 602
14 126
15 70

List of values

[35, 70, 336, 602, 1456, 2310, 3760, 5210, 6435, 5210, 3270, 2310, 966, 602, 126, 70]

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

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