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

A247070 Number of paths joining opposite corners of an n X 3 grid with every vertex appearing at most twice in the path.

Original entry on oeis.org

3, 218, 9482, 457712, 22375458, 1103498043, 54446999831, 2687689834743, 132666417488114, 6548713810387879, 323256199668617476, 15956549284724388645, 787645179268653581373, 38879655000676000582023, 1919173045780901708089448
Offset: 1

Views

Author

Keywords

Comments

Limit n->infinity a(n)^(1/n) = 49.36188601343236732586002276917911067895959865... (root of polynomial of degree 50, see the denominator of generating function). - Vaclav Kotesovec, Nov 19 2014

Examples

			For n = 1 corresponds to a straight line graph with vertices {1,2,3}. Then the a(1) = 3 solutions are 123, 12123, and 12323.
		

Crossrefs

Showing 1-1 of 1 results.