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.

A277213 Least k such that Fibonacci(k + 1) has n times as many distinct prime factors as Fibonacci(k), or 0 if no such k exists.

Table of values

n a(n)
1 3
2 7
3 17
4 23
5 29
6 47
7 167
8 419
9 83

List of values

[3, 7, 17, 23, 29, 47, 167, 419, 83]