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.

A343253 a(n) is the least k0 <= n such that v_11(n), the 11-adic order of n, can be obtained by the formula: v_11(n) = log_11(n / L_11(k0, n)), where L_11(k0, n) is the lowest common denominator of the elements of the set S_11(k0, n) = {(1/n)*binomial(n, k), with 0 < k <= k0 such that k is not divisible by 11} or 0 if no such k0 exists.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 3
7 7
8 8
9 9
10 5
11 1
12 4
13 13
14 7
15 5
16 16
17 17
18 9
19 19
20 5
21 7
22 2
23 23
24 8
25 25
26 13
27 27
28 7
29 29
30 5
31 31
32 32
33 3
34 17
35 7
36 9
37 37
38 19
39 13
40 8
41 41
42 7
43 43
44 4
45 9
46 23
47 47
48 16
49 49
50 25
51 17
52 13
53 53
54 27
55 5
56 8
57 19
58 29
59 59
60 5
61 61
62 31
63 9
64 64
65 13
66 3
67 67
68 17
69 23
70 7
71 71
72 9
73 73
74 37
75 25
76 19
77 7
78 13
79 79
80 16

List of values

[1, 2, 3, 4, 5, 3, 7, 8, 9, 5, 1, 4, 13, 7, 5, 16, 17, 9, 19, 5, 7, 2, 23, 8, 25, 13, 27, 7, 29, 5, 31, 32, 3, 17, 7, 9, 37, 19, 13, 8, 41, 7, 43, 4, 9, 23, 47, 16, 49, 25, 17, 13, 53, 27, 5, 8, 19, 29, 59, 5, 61, 31, 9, 64, 13, 3, 67, 17, 23, 7, 71, 9, 73, 37, 25, 19, 7, 13, 79, 16]