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.

A061987 Number of times n-th distinct value is repeated in sequence b(k) = 1 + b(floor(k/2)) + b(floor(k/3)) with b(0) = 0, i.e., in A061984; also number of times n-th distinct row is repeated in square array T(n,k) = T(n-1,k) + T(n-1,floor(k/2)) + T(n-1,floor(k/3)) with T(0,0) = 1, i.e., in A061980.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 1
7 3
8 4
9 2
10 6
11 3
12 5
13 4
14 12
15 6
16 10
17 8
18 9
19 15
20 12
21 20
22 16
23 18
24 30
25 24
26 27
27 13
28 32
29 36
30 60
31 48
32 54
33 26
34 64
35 72
36 81
37 39
38 96
39 108
40 52
41 128
42 144
43 162
44 78
45 192
46 216
47 104
48 139
49 117
50 288
51 324
52 156
53 384
54 432
55 208
56 278
57 234
58 576
59 648
60 312
61 417
62 351
63 864
64 416
65 556

List of values

[1, 1, 1, 1, 2, 2, 1, 3, 4, 2, 6, 3, 5, 4, 12, 6, 10, 8, 9, 15, 12, 20, 16, 18, 30, 24, 27, 13, 32, 36, 60, 48, 54, 26, 64, 72, 81, 39, 96, 108, 52, 128, 144, 162, 78, 192, 216, 104, 139, 117, 288, 324, 156, 384, 432, 208, 278, 234, 576, 648, 312, 417, 351, 864, 416, 556]