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.

A329982 a(1) = 0, and for n > 0, a(n+1) = k^2 - a(n) where k is the number of terms equal to a(n) among the first n terms.

Table of values

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

List of values

[0, 1, 0, 4, -3, 4, 0, 9, -8, 9, -5, 6, -5, 9, 0, 16, -15, 16, -12, 13, -12, 16, -7, 8, -7, 11, -10, 11, -7, 16, 0, 25, -24, 25, -21, 22, -21, 25, -16, 17, -16, 20, -19, 20, -16, 25, -9, 10, -9, 13, -9, 18, -17, 18, -14, 15, -14, 18, -9, 25, 0, 36, -35, 36, -32]

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

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