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.

A260112 Minimal number of steps to get from 0 to n by (a) adding 1 or (b) multiplying by 4.

Table of values

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

List of values

[0, 1, 2, 3, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 6, 7, 3, 4, 5, 6, 4, 5, 6, 7, 5, 6, 7, 8, 6, 7, 8, 9, 4, 5, 6, 7, 5, 6, 7, 8, 6, 7, 8, 9, 7, 8, 9, 10, 5, 6, 7, 8, 6, 7, 8, 9, 7, 8, 9, 10, 8, 9, 10, 11, 4, 5, 6, 7, 5, 6, 7, 8, 6, 7, 8, 9, 7, 8, 9, 10, 5, 6, 7, 8, 6]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.