login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A193168 Number of simple paths from (1, 1) to (n, 3) on an n X 3 grid with king moves allowed. 3
1, 24, 235, 2922, 38169, 494596, 6375379, 82191766, 1059980385, 13670322763, 176299392634, 2273637717194, 29321902354841, 378149186319554, 4876791443282017, 62893416210079645, 811103334429880838, 10460373436120693109, 134901938876902858230, 1739759409373842739031 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Simple paths are self-avoiding walks.

Note: Number of paths from (1, 1) to (n, 2) on a n X 2 grid matches the sequence A086347.

Example: a(2) = 24 paths from (1, 1) to (2, 3)

1 [(1, 1), (2, 1), (1, 2), (1, 3), (2, 3)]

2 [(1, 1), (2, 2), (1, 3), (2, 3)]

3 [(1, 1), (2, 2), (2, 1), (1, 2), (2, 3)]

4 [(1, 1), (1, 2), (2, 1), (2, 2), (1, 3), (2, 3)]

5 [(1, 1), (2, 2), (2, 1), (1, 2), (1, 3), (2, 3)]

6 [(1, 1), (1, 2), (2, 2), (1, 3), (2, 3)]

7 [(1, 1), (1, 2), (1, 3), (2, 3)]

8 [(1, 1), (2, 2), (1, 3), (1, 2), (2, 3)]

9 [(1, 1), (2, 2), (2, 3)]

10 [(1, 1), (1, 2), (2, 3)]

11 [(1, 1), (2, 2), (1, 2), (1, 3), (2, 3)]

12 [(1, 1), (2, 1), (2, 2), (1, 3), (2, 3)]

13 [(1, 1), (2, 1), (2, 2), (1, 2), (2, 3)]

14 [(1, 1), (2, 1), (1, 2), (1, 3), (2, 2), (2, 3)]

15 [(1, 1), (1, 2), (2, 1), (2, 2), (2, 3)]

16 [(1, 1), (2, 1), (2, 2), (1, 3), (1, 2), (2, 3)]

17 [(1, 1), (2, 1), (1, 2), (2, 3)]

18 [(1, 1), (1, 2), (2, 2), (2, 3)]

19 [(1, 1), (1, 2), (1, 3), (2, 2), (2, 3)]

20 [(1, 1), (2, 1), (2, 2), (1, 2), (1, 3), (2, 3)]

21 [(1, 1), (2, 2), (1, 2), (2, 3)]

22 [(1, 1), (2, 1), (2, 2), (2, 3)]

23 [(1, 1), (2, 1), (1, 2), (2, 2), (2, 3)]

24 [(1, 1), (2, 1), (1, 2), (2, 2), (1, 3), (2, 3)]

LINKS

Andrew Howroyd, Table of n, a(n) for n = 1..200

FORMULA

Conjectures from Andrew Howroyd, Nov 05 2019: (Start)

a(n) = 12*a(n-1) + 6*a(n-2) + 50*a(n-3) + 300*a(n-4) - 194*a(n-5) - 833*a(n-6) + 352*a(n-7) + 661*a(n-8) - 84*a(n-9) - 219*a(n-10) + 72*a(n-11) + 54*a(n-12) for n > 12.

G.f.: x*(1 + 12*x - 59*x^2 - 92*x^3 + 195*x^4 + 280*x^5 + 102*x^6 - 178*x^7 - 67*x^8 + 109*x^9 - 75*x^10 - 54*x^11)/((1 + x + 9*x^2 + 24*x^3 + 9*x^4)*(1 - 13*x - 2*x^2 + 45*x^3 - 24*x^4 - 22*x^5 + 9*x^6 + 8*x^7 - 6*x^8)).

(End)

CROSSREFS

Row 3 of A329118.

Cf. A086347, A140518.

Sequence in context: A027260 A125387 A126545 * A190020 A213560 A159506

Adjacent sequences:  A193165 A193166 A193167 * A193169 A193170 A193171

KEYWORD

nonn,walk

AUTHOR

Matías Benzo, Jul 17 2011

EXTENSIONS

Offset changed and more terms from Andrew Howroyd, Nov 05 2019

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 16:10 EST 2021. Contains 340246 sequences. (Running on oeis4.)