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.

A256001 Minimum sum of a nonnegative integer triple that takes n moves to reach a 0 component, where a move picks two components, subtracts the smaller from the larger, and doubles the smaller.

Table of values

n a(n)
0 0
1 3
2 6
3 11
4 15
5 23
6 27
7 45
8 81
9 105
10 195
11 329
12 597
13 885
14 1425
15 2793
16 4725
17 8025
18 14265
19 23205
20 41685

List of values

[0, 3, 6, 11, 15, 23, 27, 45, 81, 105, 195, 329, 597, 885, 1425, 2793, 4725, 8025, 14265, 23205, 41685]

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

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