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.

A367081 The least k such that exactly n binary near-repunit primes can be formed from 2^k-1 by changing one digit from 1 to 0.

Table of values

n a(n)
0 1
1 3
2 4
3 6
4 8
5 12
6 38
7 24
8 18
9 36
10 48
11 20
12 248
13 588
14 144
15 252
16 5520
17 168
18 7200
19 2400
20 2850

List of values

[1, 3, 4, 6, 8, 12, 38, 24, 18, 36, 48, 20, 248, 588, 144, 252, 5520, 168, 7200, 2400, 2850]