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.

A346696 a(n) is the least positive k such that A000041(n) divides A000041(n+k), or 0 if no such k exists.

Table of values

n a(n)
0 1
1 1
2 6
3 4
4 3
5 5
6 2
7 2
8 7
9 88
10 16
11 64
12 4
13 343
14 25
15 81
16 23
17 22
18 21
19 245
20 450
21 755
22 75
23 688
24 225
25 740
26 4432
27 307
28 671
29 1055
30 18881
31 7119
32 1415
33 4571
34 1365
35 411
36 36005
37 5799
38 3466
39 1410
40 4319
41 5993
42 646
43 60775
44 4470
45 90780
46 34595
47 36805
48 77125
49 11051
50 2514
51 46045
52 32713
53 114479
54 109221
55 19322
56 571126

List of values

[1, 1, 6, 4, 3, 5, 2, 2, 7, 88, 16, 64, 4, 343, 25, 81, 23, 22, 21, 245, 450, 755, 75, 688, 225, 740, 4432, 307, 671, 1055, 18881, 7119, 1415, 4571, 1365, 411, 36005, 5799, 3466, 1410, 4319, 5993, 646, 60775, 4470, 90780, 34595, 36805, 77125, 11051, 2514, 46045, 32713, 114479, 109221, 19322, 571126]