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.

A367185 Largest cost for a permutation problem.

Table of values

n a(n)
1 0
2 2
3 7
4 17
5 35
6 62
7 100
8 152
9 219
10 303
11 406
12 530
13 678
14 851
15 1051
16 1280
17 1540
18 1834
19 2163
20 2529
21 2934
22 3380
23 3869
24 4403
25 4985
26 5616
27 6298
28 7033
29 7823
30 8670
31 9576
32 10544
33 11575
34 12671
35 13834
36 15066
37 16369
38 17745
39 19196
40 20724
41 22332
42 24021
43 25793
44 27650
45 29594
46 31627

List of values

[0, 2, 7, 17, 35, 62, 100, 152, 219, 303, 406, 530, 678, 851, 1051, 1280, 1540, 1834, 2163, 2529, 2934, 3380, 3869, 4403, 4985, 5616, 6298, 7033, 7823, 8670, 9576, 10544, 11575, 12671, 13834, 15066, 16369, 17745, 19196, 20724, 22332, 24021, 25793, 27650, 29594, 31627]

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

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