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.

A227693 Integer nearest to (F[2n+1](S(n)))^2, where F[2n+1](x) are Fibonacci polynomials of odd indices [2n+1] and S(n) = Sum_{i=0..2} (C(i)*(log(log(A*(B+n^2))))^(2i)) (see coefficients A, B, C(i) in comments).

Table of values

n a(n)
1 4
2 25
3 168
4 1229
5 9595
6 78527
7 664408
8 5759130
9 50833725
10 455019102
11 4118498801
12 37616575907
13 346165453783
14 3205869110911
15 29851888456753
16 279286334215803
17 2623780688311969
18 24739953477533166
19 234041108830344356
20 2220562531262307905
21 21124612016460745383
22 201448482556532026684
23 1925296277838503159171
24 18437832696789559015711
25 176901280909820032014422

List of values

[4, 25, 168, 1229, 9595, 78527, 664408, 5759130, 50833725, 455019102, 4118498801, 37616575907, 346165453783, 3205869110911, 29851888456753, 279286334215803, 2623780688311969, 24739953477533166, 234041108830344356, 2220562531262307905, 21124612016460745383, 201448482556532026684, 1925296277838503159171, 18437832696789559015711, 176901280909820032014422]