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.

A205394 Least k such that n divides s(k)-s(j) for some j where s(j)=ceiling(j^2/2).

Table of values

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

List of values

[2, 3, 3, 3, 5, 4, 4, 5, 8, 6, 5, 5, 6, 8, 8, 6, 6, 9, 8, 7, 10, 12, 7, 7, 10, 14, 8, 9, 11, 8, 8, 10, 9, 18, 12, 9, 10, 20, 9, 9, 15, 10, 11, 13, 10, 24, 12, 10, 10, 15, 20, 15, 11, 12, 16, 11, 14, 30, 11, 11, 22, 32, 15, 12, 18, 14, 12, 19, 26, 12, 12, 13, 14, 38, 20, 21]