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.

A087677 Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.

Table of values

n a(n)
6 2
7 21
8 240
9 3
10 10
11 11
12 4
13 170195636
14 84
15 5
16 736
17 922709
18 6
19 38
20 40
21 7
22 374
23 10751097
24 8
25 550
26 598
27 9
28 84
29 87
30 10
31 1173908
32 1371360
33 11
34 262696240
35 203210
36 12
37 148
38 152
39 13
40 72879280
41 2419
42 14
43 588799
44 44088
45 15
46 230
47 235
48 16
49 4263
50 20523050
51 17
52 5096
53 5300
54 18
55 330
56 336

List of values

[2, 21, 240, 3, 10, 11, 4, 170195636, 84, 5, 736, 922709, 6, 38, 40, 7, 374, 10751097, 8, 550, 598, 9, 84, 87, 10, 1173908, 1371360, 11, 262696240, 203210, 12, 148, 152, 13, 72879280, 2419, 14, 588799, 44088, 15, 230, 235, 16, 4263, 20523050, 17, 5096, 5300, 18, 330, 336]