This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A205780 Least positive integer k such that n divides C(k)-C(j) for some j in [1,k-1], where C=A007598 (squared Fibonacci numbers). 1
 2, 3, 2, 3, 3, 4, 4, 3, 5, 5, 5, 4, 5, 6, 5, 4, 7, 6, 7, 5, 4, 7, 7, 4, 9, 7, 7, 6, 7, 5, 8, 6, 6, 7, 6, 6, 8, 9, 5, 6, 10, 6, 10, 7, 10, 10, 8, 6, 11, 9, 9, 7, 9, 7, 5, 6, 9, 9, 12, 5, 13, 13, 5, 8, 8, 10, 19, 7, 12, 13, 11, 6, 11, 19, 9, 9, 8, 8, 23, 6, 10, 12, 22, 6, 10, 10, 8, 7, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For a guide to related sequences, see A204892. LINKS EXAMPLE 1 divides C(2)-C(1) -> k=2, j=1 2 divides C(3)-C(1) -> k=3, j=1 3 divides C(2)-C(1) -> k=2, j=1 4 divides C(3)-C(1) -> k=3, j=1 5 divides C(3)-C(2) -> k=3, j=2 MATHEMATICA s = Table[(Fibonacci[n + 1])^2, {n, 1, 120}]; lk = Table[   NestWhile[# + 1 &, 1,    Min[Table[Mod[s[[#]] - s[[j]], z], {j, 1, # - 1}]] =!= 0 &], {z, 1,     Length[s]}] Table[NestWhile[# + 1 &, 1,   Mod[s[[lk[[j]]]] - s[[#]], j] =!= 0 &], {j, 1, Length[lk]}] (* Peter Moses, Jan 27 2012 *) CROSSREFS Cf. A204892, A007598. Sequence in context: A026256 A079715 A030397 * A204905 A082597 A112212 Adjacent sequences:  A205777 A205778 A205779 * A205781 A205782 A205783 KEYWORD nonn AUTHOR Clark Kimberling, Feb 01 2012 STATUS approved

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 .

Last modified May 23 02:06 EDT 2013. Contains 225585 sequences.