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.

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

Table of values

n a(n)
3 1
4 4
5 20
6 2
7 7
8 8
9 3
10 26631380
11 55
12 4
13 416
14 112
15 5
16 32
17 34
18 6
19 285
20 13960
21 7
22 67358874
23 214544
24 8
25 75
26 78
27 9
28 62186796
29 7399041846
30 10
31 1178
32 173857344
33 11
34 136
35 140
36 12
37 24494
38 2090
39 13
40 78824360
41 2624
42 14
43 215
44 220
45 15
46 3772
47 61617
48 16
49 23001295794169
50 78900
51 17
52 312

List of values

[1, 4, 20, 2, 7, 8, 3, 26631380, 55, 4, 416, 112, 5, 32, 34, 6, 285, 13960, 7, 67358874, 214544, 8, 75, 78, 9, 62186796, 7399041846, 10, 1178, 173857344, 11, 136, 140, 12, 24494, 2090, 13, 78824360, 2624, 14, 215, 220, 15, 3772, 61617, 16, 23001295794169, 78900, 17, 312]