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.

A375007 Numbers t which satisfy the equation: t mod k = floor((t - k)/k) mod k (1 <= k <= t) only for k = 1 and t.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 8
6 24
7 28
8 40
9 60
10 112
11 316
12 508
13 568
14 760
15 796
16 1212
17 1228
18 2616
19 5296
20 6220
21 8016
22 12456
23 14620
24 16888
25 21772
26 23116
27 23356
28 25656
29 30312
30 30712
31 30808
32 32716
33 33720
34 38328
35 46072
36 52816
37 59112
38 61728
39 67960
40 69808
41 72972

List of values

[1, 2, 3, 4, 8, 24, 28, 40, 60, 112, 316, 508, 568, 760, 796, 1212, 1228, 2616, 5296, 6220, 8016, 12456, 14620, 16888, 21772, 23116, 23356, 25656, 30312, 30712, 30808, 32716, 33720, 38328, 46072, 52816, 59112, 61728, 67960, 69808, 72972]