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.

A215540 Least k such that (2*n-1)*2^k + 1 is a prime factor of a Fermat number 2^(2^m) + 1 for some m, or 0 if no such value exists.

Table of values

n a(n)
1 1
2 41
3 7
4 14
5 67
6 18759
7 20
8 229
9 147
10 6838
11 41

List of values

[1, 41, 7, 14, 67, 18759, 20, 229, 147, 6838, 41]