|
Search: id:A111077
|
|
|
| A111077 |
|
Smallest square-free integer > the n-th term of the Fibonacci sequence. |
|
+0
2
|
|
| 1, 2, 2, 3, 5, 6, 10, 14, 22, 35, 57, 91, 145, 235, 379, 611, 989, 1598, 2585, 4182, 6766, 10947, 17713, 28658, 46369, 75026, 121394, 196419, 317813, 514230, 832042, 1346270, 2178310, 3524579, 5702889, 9227467, 14930353, 24157819, 39088171
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
a(4)= 5 because 5 is the smallest square-free integer greater than 3, the 4th number of the Fibonacci sequence.
|
|
MAPLE
|
with(numtheory): with(combinat): a:=proc(n) local B, j: B:={}: for j from 1+fibonacci(n) to 20+fibonacci(n) do if abs(mobius(j))>0 then B:=B union {j} else B:=B fi od: B[1]: end: seq(a(n), n=0..43); (Deutsch)
|
|
MATHEMATICA
|
f[n_] := Block[{k = Fibonacci[n] + 1}, While[ Union[Last /@ FactorInteger[k]][[ -1]] > 1, k++ ]; k]; Table[ f[n], {n, 0, 38}] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A005117, A000045.
Sequence in context: A050044 A004037 A050380 this_sequence A032157 A035425 A139074
Adjacent sequences: A111074 A111075 A111076 this_sequence A111078 A111079 A111080
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Joseph Buszka (jab5118(AT)psu.edu), Oct 11 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(at)rgwv.com) and Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 11 2005
|
|
|
Search completed in 0.002 seconds
|
