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.

A326834 a(0) = 0; a(1) = 0; for n > 0, a(n) = the sum of the number of times each digit in a(n-1) has occurred from a(0) to a(n-2) inclusive.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7, 0, 8, 0, 9, 0, 10, 12, 3, 1, 3, 2, 2, 3, 3, 4, 1, 4, 2, 4, 3, 5, 1, 5, 2, 5, 3, 6, 1, 6, 2, 6, 3, 7, 1, 7, 2, 7, 3, 8, 1, 8, 2, 8, 3, 9, 1, 9, 2, 9, 3, 10, 22, 20, 25, 17, 15, 17, 18, 18, 20, 28, 21, 32, 28, 25, 25, 27]