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.

A247944 2-dimensional array T(n, k) listed by antidiagonals for n >= 2, k >= 1 giving the number of acyclic paths of length k in the graph G(n) whose vertices are the integer lattice points (p, q) with 0 <= p, q < n and with an edge between v and w iff the line segment [v, w] contains no other integer lattice points.

Table of values

n a(n)
2 12
3 24
4 56
5 24
6 304
7 172
8 0
9 1400
10 1696
11 400
12 0
13 5328
14 15580
15 6072
16 836
17 0
18 16032
19 132264
20 88320
21 18608
22 1496
23 0
24 35328
25 1029232
26 1225840
27 403156
28 44520
29 2564
30 0
31 49536
32 7286016
33 16202952
34 8471480
35 1296952
36 100264
37 4080
38 0
39 32256
40 46456296
41 203422072
42 172543276
43 36960168
44 3864332
45 201992
46 6212

List of values

[12, 24, 56, 24, 304, 172, 0, 1400, 1696, 400, 0, 5328, 15580, 6072, 836, 0, 16032, 132264, 88320, 18608, 1496, 0, 35328, 1029232, 1225840, 403156, 44520, 2564, 0, 49536, 7286016, 16202952, 8471480, 1296952, 100264, 4080, 0, 32256, 46456296, 203422072, 172543276, 36960168, 3864332, 201992, 6212]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.