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.

A327743 a(n) = smallest positive number not already in the sequence such that for each k = 1, ..., n-1, the k-th differences are distinct.

Table of values

n a(n)
1 1
2 2
3 4
4 3
5 6
6 11
7 5
8 9
9 7
10 13
11 10
12 18
13 8
14 15
15 27
16 14
17 23
18 12
19 22
20 17
21 28
22 16
23 29
24 20
25 34
26 19
27 35
28 21
29 36
30 32
31 24
32 42
33 26
34 43
35 25
36 44
37 66
38 33
39 53
40 30
41 51
42 31
43 54
44 37
45 61
46 39
47 64
48 38
49 67
50 40
51 70
52 41
53 68
54 47
55 75
56 50
57 76
58 45
59 77
60 49
61 80
62 48
63 81
64 46
65 82
66 52
67 86

List of values

[1, 2, 4, 3, 6, 11, 5, 9, 7, 13, 10, 18, 8, 15, 27, 14, 23, 12, 22, 17, 28, 16, 29, 20, 34, 19, 35, 21, 36, 32, 24, 42, 26, 43, 25, 44, 66, 33, 53, 30, 51, 31, 54, 37, 61, 39, 64, 38, 67, 40, 70, 41, 68, 47, 75, 50, 76, 45, 77, 49, 80, 48, 81, 46, 82, 52, 86]

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

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