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.
%I A193168 #20 Nov 06 2019 12:39:51 %S A193168 1,24,235,2922,38169,494596,6375379,82191766,1059980385,13670322763, %T A193168 176299392634,2273637717194,29321902354841,378149186319554, %U A193168 4876791443282017,62893416210079645,811103334429880838,10460373436120693109,134901938876902858230,1739759409373842739031 %N A193168 Number of simple paths from (1, 1) to (n, 3) on an n X 3 grid with king moves allowed. %C A193168 Simple paths are self-avoiding walks. %C A193168 Note: Number of paths from (1, 1) to (n, 2) on a n X 2 grid matches the sequence A086347. %C A193168 Example: a(2) = 24 paths from (1, 1) to (2, 3) %C A193168 1 [(1, 1), (2, 1), (1, 2), (1, 3), (2, 3)] %C A193168 2 [(1, 1), (2, 2), (1, 3), (2, 3)] %C A193168 3 [(1, 1), (2, 2), (2, 1), (1, 2), (2, 3)] %C A193168 4 [(1, 1), (1, 2), (2, 1), (2, 2), (1, 3), (2, 3)] %C A193168 5 [(1, 1), (2, 2), (2, 1), (1, 2), (1, 3), (2, 3)] %C A193168 6 [(1, 1), (1, 2), (2, 2), (1, 3), (2, 3)] %C A193168 7 [(1, 1), (1, 2), (1, 3), (2, 3)] %C A193168 8 [(1, 1), (2, 2), (1, 3), (1, 2), (2, 3)] %C A193168 9 [(1, 1), (2, 2), (2, 3)] %C A193168 10 [(1, 1), (1, 2), (2, 3)] %C A193168 11 [(1, 1), (2, 2), (1, 2), (1, 3), (2, 3)] %C A193168 12 [(1, 1), (2, 1), (2, 2), (1, 3), (2, 3)] %C A193168 13 [(1, 1), (2, 1), (2, 2), (1, 2), (2, 3)] %C A193168 14 [(1, 1), (2, 1), (1, 2), (1, 3), (2, 2), (2, 3)] %C A193168 15 [(1, 1), (1, 2), (2, 1), (2, 2), (2, 3)] %C A193168 16 [(1, 1), (2, 1), (2, 2), (1, 3), (1, 2), (2, 3)] %C A193168 17 [(1, 1), (2, 1), (1, 2), (2, 3)] %C A193168 18 [(1, 1), (1, 2), (2, 2), (2, 3)] %C A193168 19 [(1, 1), (1, 2), (1, 3), (2, 2), (2, 3)] %C A193168 20 [(1, 1), (2, 1), (2, 2), (1, 2), (1, 3), (2, 3)] %C A193168 21 [(1, 1), (2, 2), (1, 2), (2, 3)] %C A193168 22 [(1, 1), (2, 1), (2, 2), (2, 3)] %C A193168 23 [(1, 1), (2, 1), (1, 2), (2, 2), (2, 3)] %C A193168 24 [(1, 1), (2, 1), (1, 2), (2, 2), (1, 3), (2, 3)] %H A193168 Andrew Howroyd, <a href="/A193168/b193168.txt">Table of n, a(n) for n = 1..200</a> %F A193168 Conjectures from _Andrew Howroyd_, Nov 05 2019: (Start) %F A193168 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. %F A193168 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)). %F A193168 (End) %Y A193168 Row 3 of A329118. %Y A193168 Cf. A086347, A140518. %K A193168 nonn,walk %O A193168 1,2 %A A193168 _MatÃas Benzo_, Jul 17 2011 %E A193168 Offset changed and more terms from _Andrew Howroyd_, Nov 05 2019