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.

A109636 Let T(n,k) be the n-th k-almost prime. Then a(n) = T(n,k) such that k is minimal and for all m>0, T(n,k+m) >= 2^m * T(n,k).

Table of values

n a(n)
1 2
2 3
3 9
4 10
5 27
6 28
7 30
8 81
9 84
10 88
11 90
12 100
13 104
14 243
15 252
16 264
17 270
18 272
19 280
20 300
21 304
22 312
23 729
24 736
25 756
26 784
27 792
28 810
29 816
30 840
31 880
32 900
33 912
34 928
35 936
36 992
37 1000
38 1040
39 2187
40 2208
41 2268
42 2352
43 2368
44 2376
45 2430
46 2448
47 2464
48 2520
49 2624

List of values

[2, 3, 9, 10, 27, 28, 30, 81, 84, 88, 90, 100, 104, 243, 252, 264, 270, 272, 280, 300, 304, 312, 729, 736, 756, 784, 792, 810, 816, 840, 880, 900, 912, 928, 936, 992, 1000, 1040, 2187, 2208, 2268, 2352, 2368, 2376, 2430, 2448, 2464, 2520, 2624]