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.

A249122 a(n) = floor(n / lpf(n^2 + 1)) where lpf(n^2 + 1) is the smallest prime divisor of n^2 + 1.

Table of values

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

List of values

[0, 0, 1, 0, 2, 0, 3, 1, 4, 0, 5, 2, 6, 0, 7, 0, 8, 3, 9, 0, 10, 4, 11, 0, 12, 0, 13, 5, 14, 1, 15, 6, 16, 2, 17, 0, 18, 7, 19, 0, 20, 8, 21, 3, 22, 1, 23, 9, 24, 1, 25, 10, 26, 0, 27, 0, 28, 11, 29, 4, 30, 12, 31, 3, 32, 0, 33, 13, 34, 5, 35, 14, 36, 0, 37, 1]