login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247070 Number of paths joining opposite corners of an n X 3 grid with every vertex appearing at most twice in the path. 2
3, 218, 9482, 457712, 22375458, 1103498043, 54446999831, 2687689834743, 132666417488114, 6548713810387879, 323256199668617476, 15956549284724388645, 787645179268653581373, 38879655000676000582023, 1919173045780901708089448 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
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
LINKS
Muhammad Kholilurrohman, Table of n, a(n) for n = 1..300
EXAMPLE
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
Sequence in context: A225362 A063836 A172811 * A140441 A261385 A071881
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)