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.

A104740 a(1) = 1; for n > 1: if n is even, a(n) = least k > 0 such that sum(i=1,n/2,a(2*i-1))/sum(j=1,n,a(j))>=1/4, or 1 if there is no such k; if n is odd, a(n) = largest k > 0 such that sum(i=1,(n+1)/2,a(2*i-1))/sum(j=1,n,a(j))<=1/3, or 1 if there is no such k.

Table of values

n a(n)
1 1
2 3
3 1
4 3
5 1
6 3
7 1
8 3
9 2
10 6
11 3
12 9
13 4
14 12
15 6
16 18
17 9
18 27
19 14
20 42
21 21
22 63
23 31
24 93
25 47
26 141
27 70
28 210
29 105
30 315
31 158
32 474
33 237
34 711
35 355
36 1065
37 533
38 1599
39 799
40 2397
41 1199
42 3597
43 1798
44 5394
45 2697
46 8091
47 4046
48 12138
49 6069
50 18207
51 9103
52 27309
53 13655
54 40965
55 20482
56 61446

List of values

[1, 3, 1, 3, 1, 3, 1, 3, 2, 6, 3, 9, 4, 12, 6, 18, 9, 27, 14, 42, 21, 63, 31, 93, 47, 141, 70, 210, 105, 315, 158, 474, 237, 711, 355, 1065, 533, 1599, 799, 2397, 1199, 3597, 1798, 5394, 2697, 8091, 4046, 12138, 6069, 18207, 9103, 27309, 13655, 40965, 20482, 61446]