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.

A096269 a(n) = number of distinct palindromes of length n that occur in A096268.

Table of values

n a(n)
1 2
2 1
3 3
4 0
5 4
6 0
7 3
8 0
9 4
10 0
11 4
12 0
13 3
14 0
15 3
16 0
17 4
18 0
19 4
20 0
21 4
22 0
23 4
24 0
25 3
26 0
27 3
28 0
29 3
30 0
31 3
32 0
33 4
34 0
35 4
36 0
37 4
38 0
39 4
40 0
41 4
42 0
43 4
44 0
45 4
46 0
47 4
48 0
49 3
50 0
51 3
52 0
53 3
54 0
55 3
56 0
57 3
58 0
59 3
60 0
61 3
62 0
63 3
64 0
65 4
66 0
67 4
68 0
69 4
70 0
71 4
72 0
73 4
74 0
75 4
76 0
77 4
78 0
79 4
80 0
81 4
82 0
83 4
84 0
85 4
86 0
87 4
88 0
89 4
90 0
91 4
92 0
93 4
94 0
95 4
96 0
97 3
98 0
99 3
100 0
101 3
102 0
103 3
104 0
105 3

List of values

[2, 1, 3, 0, 4, 0, 3, 0, 4, 0, 4, 0, 3, 0, 3, 0, 4, 0, 4, 0, 4, 0, 4, 0, 3, 0, 3, 0, 3, 0, 3, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 3, 0, 3, 0, 3, 0, 3, 0, 3]