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.

A260258 T(n,k) is the array read by rows, n>0 and k=1..q (with q = number of prime distinct divisors of n^2+1) giving the number of occurrences of the k-th prime divisor of n^2+1 counted from the prime divisors of m^2+1 for m=1..n.

Table of values

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

List of values

[1, 1, 2, 2, 1, 3, 1, 1, 4, 3, 4, 2, 5, 1, 1, 6, 1, 5, 1, 7, 6, 2, 1, 8, 1, 1, 9, 7, 2, 8, 3, 10, 1, 1, 11, 4, 3, 9, 1, 12, 10, 1, 1, 13, 1, 1, 14, 11, 1, 12, 1, 15, 1, 4, 2, 16, 5, 2, 13, 2, 17, 14, 1, 6, 1, 18, 1, 1, 19, 15, 1, 16, 5, 20, 1, 1, 21, 3, 17, 1]