|
Search: id:A061305
|
|
|
| A061305 |
|
Square-free Fibonacci numbers. |
|
+0
4
|
|
| 1, 1, 2, 3, 5, 13, 21, 34, 55, 89, 233, 377, 610, 987, 1597, 4181, 6765, 10946, 17711, 28657, 121393, 196418, 317811, 514229, 1346269, 2178309, 3524578, 5702887, 9227465, 24157817, 39088169, 63245986, 102334155, 165580141, 433494437, 701408733, 1134903170, 1836311903
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Zak Seidov, Table of n, a(n) for n = 1..200.
|
|
EXAMPLE
|
55 = 5 * 11 is a square-free Fibonacci number.
|
|
MATHEMATICA
|
Needs["NumberTheory`NumberTheoryFunctions`"]; a={}; Do[f=Fibonacci[n]; If[SquareFreeQ[f], AppendTo[a, f]], {n, 1, 30}]; a (Vladimir Orlovsky, Jul 22 2008)
|
|
CROSSREFS
|
Cf. A000045.
Sequence in context: A042047 A087763 A104735 this_sequence A048736 A087898 A072537
Adjacent sequences: A061302 A061303 A061304 this_sequence A061306 A061307 A061308
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 26 2001
|
|
EXTENSIONS
|
More terms from Asher Natan Auel (auela(AT)reed.edu), May 14, 2001
|
|
|
Search completed in 0.002 seconds
|
