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.

A356872 a(n) = k is the smallest number such that 3*k+1 contains n distinct prime factors.

Table of values

n a(n)
1 1
2 3
3 23
4 303
5 4363
6 56723
7 1077743
8 33410043
9 718854803
10 22284498903
11 824526459423
12 35454637755203
13 1588862487308763
14 68321086954276823
15 4167586304210886223
16 213640038906023626563
17 13032042373267441220363
18 873146839008918561764343
19 63739719247651055008797063

List of values

[1, 3, 23, 303, 4363, 56723, 1077743, 33410043, 718854803, 22284498903, 824526459423, 35454637755203, 1588862487308763, 68321086954276823, 4167586304210886223, 213640038906023626563, 13032042373267441220363, 873146839008918561764343, 63739719247651055008797063]

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

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