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.
%I A120297 #11 Sep 24 2018 02:40:11
%S A120297 1,5,20,65,193,544,1489,4005,10660,28193,74273,195200,512257,1343077,
%T A120297 3519412,9219105,24144289,63224096,165544721,433437125,1134810436,
%U A120297 2971065025,7778499265,20364618240,53315655553,139582833989
%N A120297 Sum of all matrix elements of n X n matrix M(i,j) = Fibonacci(i+j-1).
%C A120297 p^2 divides a(p-1) for p = 5, 11, 19, 29, 31, 41, 59, 61, 71, ... = A038872 (Primes congruent to {0, 1, 4} mod 5), also odd primes p such that where 5 is a square mod p. All squared prime divisors of a(n) also belong to A038872.
%H A120297 Vincenzo Librandi, <a href="/A120297/b120297.txt">Table of n, a(n) for n = 1..200</a>
%F A120297 a(n) = Sum_{j=1..n} Sum_{i=1..n} Fibonacci(i+j-1).
%F A120297 a(n) = Fibonacci(2*n+3) - 2*Fibonacci(n+3) + 2. - _Vladeta Jovovic_, Jul 21 2006
%F A120297 G.f.: (1 - x^3 + 2*x^2)/((x-1)*(x^2 + x - 1)*(x^2 - 3*x + 1)). - Maksym Voznyy (voznyy(AT)mail.ru), Aug 14 2009
%e A120297 Matrix begins:
%e A120297 1 1 2 3 5
%e A120297 1 2 3 5 8
%e A120297 2 3 5 8 13
%e A120297 3 5 8 13 21
%e A120297 5 8 13 21 34
%t A120297 Table[Sum[Sum[Fibonacci[i+j-1],{i,1,n}],{j,1,n}],{n,1,50}]
%Y A120297 Cf. A000045, A038872, A001924, A062381.
%K A120297 nonn
%O A120297 1,2
%A A120297 _Alexander Adamchuk_, Jul 11 2006