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.

A339315 a(n) is the smallest number k such that k^2+1 divided by its largest prime factor is equal to F(2*n-1) for n > 0, or 0 if no such k exists, where F(n) is the Fibonacci sequence.

Table of values

n a(n)
1 1
2 3
3 8
4 34
5 55
6 144
7 610
8 233
9 12166
10 2584
11 4181
12 68260
13 46368
14 75025
15 3917414
16 464656
17 1346269
18 16349962

List of values

[1, 3, 8, 34, 55, 144, 610, 233, 12166, 2584, 4181, 68260, 46368, 75025, 3917414, 464656, 1346269, 16349962]

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

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