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.

A056796 Minimal number of steps to get from 0 to n when there are 3 kinds of step: add 1, multiply by 2, multiply by 3.

Table of values

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

List of values

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

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

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