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.

A173381 a(n) = b_n(p_(n+1)) where p_n is the n-th prime, b_n(1)=1, b_n(2)=p_n, and for k>=3, b_n(k) is the smallest number larger than b_n(k-1) such that, for all i is relatively prime to b_n(i) iff k is relatively prime to i.

Table of values

n a(n)
1 3
2 11
3 31
4 163
5 661
6 929
7 2041
8 21341
9 15989
10 47387
11 125117
12 263411
13 123493
14 10426601
15 3654221
16 4167127
17 86622397
18 4036267
19 3910993
20 541513877

List of values

[3, 11, 31, 163, 661, 929, 2041, 21341, 15989, 47387, 125117, 263411, 123493, 10426601, 3654221, 4167127, 86622397, 4036267, 3910993, 541513877]

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

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