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.

A205396 Least s(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 5
3 5
4 5
5 13
6 8
7 8
8 13
9 32
10 18
11 13
12 13
13 18
14 32
15 32
16 18
17 18
18 41
19 32
20 25
21 50
22 72
23 25
24 25
25 50
26 98
27 32
28 41
29 61
30 32
31 32
32 50
33 41
34 162
35 72
36 41
37 50
38 200
39 41
40 41
41 113
42 50
43 61
44 85
45 50
46 288
47 72
48 50
49 50
50 113
51 200
52 113
53 61
54 72
55 128
56 61
57 98
58 450
59 61
60 61
61 242
62 512
63 113
64 72

List of values

[2, 5, 5, 5, 13, 8, 8, 13, 32, 18, 13, 13, 18, 32, 32, 18, 18, 41, 32, 25, 50, 72, 25, 25, 50, 98, 32, 41, 61, 32, 32, 50, 41, 162, 72, 41, 50, 200, 41, 41, 113, 50, 61, 85, 50, 288, 72, 50, 50, 113, 200, 113, 61, 72, 128, 61, 98, 450, 61, 61, 242, 512, 113, 72]

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

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