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.

A064496 a(n) is the least k such that k * A007519(n) + 1 = 0 (mod 12).

Table of values

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

List of values

[7, 7, 11, 7, 11, 7, 7, 11, 7, 11, 7, 7, 11, 11, 7, 7, 11, 11, 7, 11, 7, 7, 11, 7, 11, 7, 7, 11, 7, 11, 7, 7, 7, 7, 11, 7, 7, 11, 11, 7, 7, 11, 11, 7, 11, 7, 11, 7, 11, 11, 7, 7, 7, 7, 11, 7, 7, 11, 11, 7, 7, 11, 11, 11, 11, 7, 7, 11, 11, 7, 11, 11, 7, 11, 7]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.