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 A250093 #27 Sep 08 2022 08:46:10
%S A250093 1,3,34,987,3001,103683,7778742049,10610209857723,37889062373143906,
%T A250093 14168993927170476603,8670007398507948658051921,
%U A250093 964523271222730372229194083,93202207781383214849429075266681969,40934782466626840596168752972961528246147
%N A250093 Squarefree part of Fibonacci(n^2).
%C A250093 Also, the smallest number such that a(n)*Fibonacci(n^2) is a square.
%C A250093 Conjecture: the only primes in this sequence are 3 and 3001.
%H A250093 Amiram Eldar, <a href="/A250093/b250093.txt">Table of n, a(n) for n = 1..37</a>
%F A250093 a(n) = A069110(n^2).
%t A250093 Table[Times@@Power@@@({#[[1]], Mod[#[[2]], 2]}&/@FactorInteger[Fibonacci[n^2]]), {n, 20}]
%o A250093 (Magma) [SquareFree(Fibonacci(n^2)): n in [1..20]];
%o A250093 (PARI) for(n=1, 60, print1(core(fibonacci(n^2)), ", "))
%Y A250093 Cf. A037918, A061305, A061899, A063509, A069110.
%K A250093 nonn
%O A250093 1,2
%A A250093 _Vincenzo Librandi_, Nov 12 2014