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 A069110 #18 Sep 08 2022 08:45:05
%S A069110 1,1,2,3,5,2,13,21,34,55,89,1,233,377,610,987,1597,646,4181,6765,
%T A069110 10946,17711,28657,322,3001,121393,196418,317811,514229,208010,
%U A069110 1346269,2178309,3524578,5702887,9227465,103683,24157817,39088169,63245986
%N A069110 Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.
%H A069110 Amiram Eldar, <a href="/A069110/b069110.txt">Table of n, a(n) for n = 1..1408</a> (terms 1..200 from Vincenzo Librandi)
%t A069110 Column[Table[Times@@Power@@@({#[[1]], Mod[#[[2]], 2]}&/@FactorInteger[Fibonacci[n]]), {n, 20}]] (* _Vincenzo Librandi_, Nov 13 2014 *)
%o A069110 (PARI) for(n=1,60,print1(core(fibonacci(n)),","))
%o A069110 (Magma) [SquareFree(Fibonacci(n)): n in [1..20]]; // _Vincenzo Librandi_, Nov 13 2014
%Y A069110 Cf. A007913.
%K A069110 easy,nonn
%O A069110 1,3
%A A069110 _Benoit Cloitre_, Apr 06 2002