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.

A205404 Least s(k) such that n divides s(k)-s(j) for some j < k, where s(j) = floor((j+1)^2/2)/2.

Table of values

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

List of values

[2, 4, 4, 6, 6, 12, 9, 9, 20, 12, 12, 16, 25, 16, 16, 20, 36, 20, 20, 36, 25, 42, 25, 25, 56, 30, 36, 30, 30, 36, 56, 36, 42, 36, 36, 42, 49, 42, 64, 42, 42, 72, 49, 56, 49, 110, 49, 49, 100, 56, 81, 56, 110, 56, 56, 72, 121, 64, 169, 64, 81, 64, 64, 100, 81, 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.