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.

A175895 Number of lattice paths from (0,0) to (n,n) using steps S={(k,0),(0,k),(1,1)|0

Original entry on oeis.org

1, 2, 9, 50, 314, 2116, 14949, 109246, 818978, 6263072, 48668366, 383182648, 3050196328, 24506969724, 198482172753, 1618700191002, 13281652367078, 109564878995724, 908171084052990, 7560049450347964, 63176859344766204
Offset: 0

Views

Author

Eric Werley, Dec 05 2010

Keywords

Examples

			a(2)=9 because we can reach (2,2) in the following ways:
(1,0),(1,0),(0,1),(0,1)
(1,0),(1,0),(0,2)
(2,0),(0,1),(0,1)
(2,0),(0,2)
(1,0),(1,1),(0,1)
(1,0),(0,1),(1,1)
(1,1),(1,0),(0,1)
(1,1),(0,1),(1,0)
(1,1)(1,1)
		

Crossrefs