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.

A327787 a(n) is the smallest Carmichael number k such that gpf(p-1) = prime(n) for all prime factors p of k.

Table of values

n a(n)
2 1729
3 252601
4 1152271
5 1615681
6 4335241
7 172947529
8 214852609
9 79624621
10 178837201
11 775368901
12 686059921
13 985052881
14 5781222721
15 10277275681
16 84350561
17 5255104513
18 492559141
19 74340674101
20 9293756581
21 1200778753
22 129971289169
23 2230305949
24 851703301
25 8714965001
26 6693621481

List of values

[1729, 252601, 1152271, 1615681, 4335241, 172947529, 214852609, 79624621, 178837201, 775368901, 686059921, 985052881, 5781222721, 10277275681, 84350561, 5255104513, 492559141, 74340674101, 9293756581, 1200778753, 129971289169, 2230305949, 851703301, 8714965001, 6693621481]

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

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