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.

A371895 a(n) is the least k>0 such that n*k contains the n-th prime as a substring.

Table of values

n a(n)
1 2
2 15
3 5
4 18
5 22
6 22
7 25
8 24
9 26
10 29
11 21
12 31
13 32
14 31
15 98
16 96
17 27
18 34
19 88
20 355
21 13
22 36
23 21
24 79
25 39
26 39
27 189
28 383
29 376
30 371
31 41
32 41
33 416
34 41
35 426
36 42
37 425
38 43
39 43
40 433
41 419
42 431
43 237
44 44
45 266
46 433
47 45
48 465
49 464
50 458
51 83
52 46
53 423
54 417
55 468
56 47
57 472
58 468
59 47
60 469
61 103
62 473
63 488
64 486
65 202
66 481
67 348
68 496
69 63
70 499

List of values

[2, 15, 5, 18, 22, 22, 25, 24, 26, 29, 21, 31, 32, 31, 98, 96, 27, 34, 88, 355, 13, 36, 21, 79, 39, 39, 189, 383, 376, 371, 41, 41, 416, 41, 426, 42, 425, 43, 43, 433, 419, 431, 237, 44, 266, 433, 45, 465, 464, 458, 83, 46, 423, 417, 468, 47, 472, 468, 47, 469, 103, 473, 488, 486, 202, 481, 348, 496, 63, 499]

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

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