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.

A078349 Number of primes in sequence h(m) defined by h(1) = n, h(m+1) = Floor(h(m)/2).

Table of values

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

List of values

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