|
Search: id:A114555
|
|
|
| A114555 |
|
Smallest non-square-free integer > the n-th term of the Fibonacci sequence. |
|
+0
1
|
|
| 4, 4, 4, 4, 8, 9, 16, 24, 36, 56, 90, 147, 234, 378, 612, 988, 1600, 2588, 4184, 6768, 10948, 17712, 28660, 46372, 75028, 121396, 196420, 317812, 514232, 832041, 1346272, 2178312, 3524580, 5702888, 9227466, 14930356, 24157818, 39088170
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(4)= 4 because 4 is the smallest non-square-free integer greater than 3, the 4th number of the Fibonacci sequence.
|
|
MATHEMATICA
|
(* first load package *) << NumberTheory`NumberTheoryFunctions` (* then do *) f[n_] := Block[{k = 1 + Fibonacci@n}, While[SquareFreeQ@k, k++ ]; k]; Array[f, 38] (* Robert G. Wilson v *)
|
|
CROSSREFS
|
Cf. A005117, A000045, A111077.
Sequence in context: A120327 A056629 A081676 this_sequence A124570 A053187 A013189
Adjacent sequences: A114552 A114553 A114554 this_sequence A114556 A114557 A114558
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Brandon S. Paster (bsp11(AT)psu.edu), Dec 08 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 22 2005
|
|
|
Search completed in 0.002 seconds
|
