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.

A259496 Numbers n such that phi(n) + d(n) = phi(n+1) + d(n+1), where phi(n) is the Euler totient function of n and d(n) the number of divisors of n.

Table of values

n a(n)
1 5
2 7
3 104
4 105
5 1754
6 3255
7 16215
8 22935
9 67431
10 93074
11 983775
12 1025504
13 2200694
14 2619705
15 3365438
16 4163355
17 4447064
18 4695704
19 6372794
20 7838265
21 9718904
22 11903775
23 23992215
24 26879684
25 29357475
26 37239735
27 40588485
28 41207144
29 48615735
30 56424555
31 76466985
32 81591194
33 83864055

List of values

[5, 7, 104, 105, 1754, 3255, 16215, 22935, 67431, 93074, 983775, 1025504, 2200694, 2619705, 3365438, 4163355, 4447064, 4695704, 6372794, 7838265, 9718904, 11903775, 23992215, 26879684, 29357475, 37239735, 40588485, 41207144, 48615735, 56424555, 76466985, 81591194, 83864055]

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

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