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.

A081850 Consider recurrence b(0) = (2n+1)/4, b(n) = b(0)*ceiling(b(n-1)); sequence gives number of steps to reach an integer (or -1 if no integer is ever reached).

Table of values

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

List of values

[3, 2, 3, 13, 1, 1, 4, 2, 2, 9, 2, 2, 1, 1, 7, 3, 7, 3, 4, 3, 1, 1, 2, 4, 5, 10, 5, 13, 1, 1, 14, 8, 5, 2, 10, 11, 1, 1, 6, 2, 2, 17, 2, 2, 1, 1, 3, 6, 16, 5, 3, 4, 1, 1, 2, 4, 7, 9, 4, 3, 1, 1, 15, 9, 4, 2, 7, 5, 1, 1, 3, 2, 2, 3, 2, 2, 1, 1, 5, 5, 6, 5, 6, 4, 1, 1, 2, 4, 4, 3, 3, 11, 1, 1, 3, 3, 7, 2, 4]