login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069110 Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square. 2

%I #18 Sep 08 2022 08:45:05

%S 1,1,2,3,5,2,13,21,34,55,89,1,233,377,610,987,1597,646,4181,6765,

%T 10946,17711,28657,322,3001,121393,196418,317811,514229,208010,

%U 1346269,2178309,3524578,5702887,9227465,103683,24157817,39088169,63245986

%N Squarefree part of F(n) (the Fibonacci numbers): the smallest number such that a(n)*F(n) is a square.

%H Amiram Eldar, <a href="/A069110/b069110.txt">Table of n, a(n) for n = 1..1408</a> (terms 1..200 from Vincenzo Librandi)

%t Column[Table[Times@@Power@@@({#[[1]], Mod[#[[2]], 2]}&/@FactorInteger[Fibonacci[n]]), {n, 20}]] (* _Vincenzo Librandi_, Nov 13 2014 *)

%o (PARI) for(n=1,60,print1(core(fibonacci(n)),","))

%o (Magma) [SquareFree(Fibonacci(n)): n in [1..20]]; // _Vincenzo Librandi_, Nov 13 2014

%Y Cf. A007913.

%K easy,nonn

%O 1,3

%A _Benoit Cloitre_, Apr 06 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 9 13:12 EDT 2024. Contains 375042 sequences. (Running on oeis4.)