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.

A120947 a(n) = smallest m such that n-th prime divides Pell(m).

Table of values

n a(n)
1 2
2 4
3 3
4 6
5 12
6 7
7 8
8 20
9 22
10 5
11 30
12 19
13 10
14 44
15 46
16 27
17 20
18 31
19 68
20 70
21 36
22 26
23 84
24 44
25 48
26 51
27 34
28 108
29 55
30 28
31 126
32 132
33 17
34 140
35 75
36 150
37 79
38 164
39 166
40 87
41 36
42 91
43 190
44 96
45 9
46 18
47 212
48 74
49 76
50 23
51 116
52 14
53 40
54 84
55 64
56 262
57 15
58 270
59 139
60 140
61 284
62 49
63 308
64 310
65 78
66 159
67 332

List of values

[2, 4, 3, 6, 12, 7, 8, 20, 22, 5, 30, 19, 10, 44, 46, 27, 20, 31, 68, 70, 36, 26, 84, 44, 48, 51, 34, 108, 55, 28, 126, 132, 17, 140, 75, 150, 79, 164, 166, 87, 36, 91, 190, 96, 9, 18, 212, 74, 76, 23, 116, 14, 40, 84, 64, 262, 15, 270, 139, 140, 284, 49, 308, 310, 78, 159, 332]

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

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