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.

A384844 Triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the n-Dorogovtsev-Goltsev-Mendes graph.

Table of values

n a(n)
1 3
2 9
3 6
4 27
5 57
6 21
7 81
8 351
9 369
10 60
11 243
12 1806
13 3582
14 1716
15 156
16 729
17 8472
18 26346
19 24216
20 6648
21 384
22 2187
23 37683
24 165375
25 241032
26 128880
27 22896
28 912
29 6561
30 162177
31 938907
32 1946676
33 1670280
34 584784
35 72624
36 2112
37 19683
38 683112
39 4979928
40 13697148
41 16889340
42 9580368
43 2366256
44 216768
45 4800

List of values

[3, 9, 6, 27, 57, 21, 81, 351, 369, 60, 243, 1806, 3582, 1716, 156, 729, 8472, 26346, 24216, 6648, 384, 2187, 37683, 165375, 241032, 128880, 22896, 912, 6561, 162177, 938907, 1946676, 1670280, 584784, 72624, 2112, 19683, 683112, 4979928, 13697148, 16889340, 9580368, 2366256, 216768, 4800]

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

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