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.

A369829 a(0) = 0; for n > 0, if n appears in the sequence then a(n) = a(n-1) - sum of indexes where n appeared if that is nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + sum of indexes. Otherwise a(n) = a(n-1) - n if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + n.

Table of values

n a(n)
0 0
1 1
2 3
3 5
4 9
5 6
6 11
7 4
8 12
9 8
10 18
11 24
12 16
13 29
14 15
15 29
16 17
17 33
18 23
19 42
20 22
21 43
22 63
23 45
24 34
25 59
26 85
27 58
28 30
29 2
30 30
31 61
32 93
33 76
34 52
35 87
36 51
37 14
38 52
39 13
40 53
41 94
42 75
43 54
44 10
45 33
46 79
47 32
48 80
49 31
50 81
51 117
52 189
53 149
54 106
55 161
56 105
57 48
58 21
59 80
60 20

List of values

[0, 1, 3, 5, 9, 6, 11, 4, 12, 8, 18, 24, 16, 29, 15, 29, 17, 33, 23, 42, 22, 43, 63, 45, 34, 59, 85, 58, 30, 2, 30, 61, 93, 76, 52, 87, 51, 14, 52, 13, 53, 94, 75, 54, 10, 33, 79, 32, 80, 31, 81, 117, 189, 149, 106, 161, 105, 48, 21, 80, 20]

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

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