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.

A380272 a(n) is the number of integers k in 0..n such that the nonadjacent forms for n-k and k can be added without carries (see Comments section for exact definition).

Table of values

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

List of values

[1, 2, 2, 2, 4, 4, 2, 2, 6, 4, 4, 2, 4, 4, 2, 6, 12, 8, 4, 6, 10, 8, 2, 2, 6, 4, 4, 2, 4, 4, 6, 10, 22, 12, 8, 6, 10, 8, 6, 6, 16, 8, 8, 2, 4, 4, 2, 6, 12, 8, 4, 6, 10, 8, 2, 2, 6, 4, 4, 10, 16, 12, 10, 22, 44, 24, 12, 14, 22, 16, 6, 6, 16, 8, 8, 10, 16, 12, 6]