This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A157420 a(0)=1. a(n) = the smallest integer coprime to a(n-1) and greater than the n-th Fibonacci number. 3

%I

%S 1,2,3,4,5,6,11,14,23,35,57,91,145,234,379,611,989,1598,2587,4182,

%T 6767,10947,17713,28658,46371,75026,121395,196421,317812,514233,

%U 832042,1346271,2178310,3524579,5702889,9227467,14930353,24157818,39088171

%N a(0)=1. a(n) = the smallest integer coprime to a(n-1) and greater than the n-th Fibonacci number.

%e a(7) = 14, and the 8th Fibonacci number is 21. So for a(8) we want the smallest integer that is both coprime to 14 and is > 21. Checking: 22 is not coprime to 14. But 23 is coprime to 14, so a(8) = 23.

%Y Cf. A157419, A157421.

%K nonn

%O 0,2

%A Leroy Quet, Feb 28 2009

%E Extended by _Ray Chandler_, Jun 19 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .