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.

A130320 Given n numbers n>(n-1)>(n-2)>...>2>1, adding the first and last numbers leads to the identity n+1 = (n-1)+2 = (n-2)+3 = ... In case if some positive x_1, x_2, ... are added to n, (n-1) etc, the strict inequality could be retained. This could be repeated finitely many times till it ends in inequality of form M > N where M-N is minimal. This sequence gives the value of M for different n.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 10
6 16
7 18
8 22
9 34
10 40
11 56
12 64
13 66
14 74
15 78
16 86
17 130
18 142
19 148
20 160
21 216
22 232
23 240
24 256
25 258
26 274
27 282
28 298
29 302
30 318
31 326
32 342
33 514
34 538
35 550
36 574
37 580
38 604
39 616
40 640
41 856
42 888
43 904
44 936
45 944
46 976
47 992
48 1024
49 1026
50 1058
51 1074
52 1106
53 1114
54 1146
55 1162
56 1194
57 1198

List of values

[1, 2, 4, 6, 10, 16, 18, 22, 34, 40, 56, 64, 66, 74, 78, 86, 130, 142, 148, 160, 216, 232, 240, 256, 258, 274, 282, 298, 302, 318, 326, 342, 514, 538, 550, 574, 580, 604, 616, 640, 856, 888, 904, 936, 944, 976, 992, 1024, 1026, 1058, 1074, 1106, 1114, 1146, 1162, 1194, 1198]

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

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