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.

A062247 Let f(h) = A141900(h) = 2^h * 3^i * 5^j * ... be the smallest term in A141586 that is divisible by 2^h but not by 2^(h+1). Sequence gives values of h where i increases.

Table of values

n a(n)
1 0
2 2
3 8
4 24
5 26
6 48
7 80
8 120
9 168
10 242
11 288
12 360
13 528
14 728
15 840
16 960
17 1330
18 1368
19 1680
20 1848
21 2186
22 2208
23 2808
24 3480
25 3720
26 4488
27 5040
28 5328
29 6240
30 6560
31 6888
32 7920
33 9408

List of values

[0, 2, 8, 24, 26, 48, 80, 120, 168, 242, 288, 360, 528, 728, 840, 960, 1330, 1368, 1680, 1848, 2186, 2208, 2808, 3480, 3720, 4488, 5040, 5328, 6240, 6560, 6888, 7920, 9408]