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.

A145787 Number of times you have to move n cards from one pile to another doing one up, one down, until you obtain the initial sequence.

Table of values

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

List of values

[1, 2, 2, 3, 3, 6, 6, 4, 4, 6, 6, 10, 10, 14, 14, 5, 5, 18, 18, 10, 10, 12, 12, 21, 21, 26, 26, 9, 9, 30, 30, 6, 6, 22, 22, 9, 9, 30, 30, 27, 27, 8, 8, 11, 11, 10, 10, 24, 24, 50, 50, 12, 12, 18, 18, 14, 14, 12, 12, 55, 55, 50, 50, 7, 7, 18, 18, 34, 34, 46, 46]

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

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