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.

A301270 Number of labeled trees on n vertices containing two fixed non-adjacent edges.

Table of values

n a(n)
4 4
5 20
6 144
7 1372
8 16384
9 236196
10 4000000
11 77948684
12 1719926784
13 42417997492
14 1157018619904
15 34599023437500
16 1125899906842624
17 39618312131623748
18 1499253470328324096
19 60724508119499193196
20 2621440000000000000000
21 120167769980326767578964
22 5829995856912430117421056
23 298461883710362842247633948
24 16079954871362414694843285504

List of values

[4, 20, 144, 1372, 16384, 236196, 4000000, 77948684, 1719926784, 42417997492, 1157018619904, 34599023437500, 1125899906842624, 39618312131623748, 1499253470328324096, 60724508119499193196, 2621440000000000000000, 120167769980326767578964, 5829995856912430117421056, 298461883710362842247633948, 16079954871362414694843285504]

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

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