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.

A179620 a(n) = largest k such that A002808(n+1) = A002808(n) + (A002808(n) mod k), or 0 if no such k exists.

Table of values

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

List of values

[0, 4, 7, 8, 8, 10, 13, 14, 14, 16, 19, 20, 20, 23, 24, 25, 26, 26, 28, 31, 32, 33, 34, 34, 37, 38, 38, 40, 43, 44, 44, 47, 48, 49, 50, 50, 53, 54, 55, 56, 56, 58, 61, 62, 63, 64, 64, 67, 68, 68, 70, 73, 74, 75, 76, 76, 79, 80, 80, 83, 84, 85, 86, 86, 89]

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

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