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.

A139081 a(n) = (largest prime power dividing n) + (largest prime power dividing (n+1)).

Table of values

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

List of values

[3, 5, 7, 9, 8, 10, 15, 17, 14, 16, 15, 17, 20, 12, 21, 33, 26, 28, 24, 12, 18, 34, 31, 33, 38, 40, 34, 36, 34, 36, 63, 43, 28, 24, 16, 46, 56, 32, 21, 49, 48, 50, 54, 20, 32, 70, 63, 65, 74, 42, 30, 66, 80, 38, 19, 27, 48, 88, 64, 66, 92, 40, 73, 77, 24, 78, 84, 40, 30]

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

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