login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205442 Least k such that n divides s(k)-s(j) for some j<k, where s(j) is the (2j-1)-st Fibonacci number. 9

%I #5 Mar 30 2012 18:58:11

%S 2,3,3,3,6,4,5,4,7,7,4,4,8,6,11,5,10,7,6,7,5,6,13,7,26,9,19,6,5,12,9,

%T 5,5,10,21,7,20,6,15,16,11,6,23,6,31,13,9,7,29,27,19,9,28,19,6,13,7,7,

%U 16,12

%N Least k such that n divides s(k)-s(j) for some j<k, where s(j) is the (2j-1)-st Fibonacci number.

%C See A204892 for a discussion and guide to related sequences.

%t s[n_] := s[n] = Fibonacci[2*n - 1]; z1 = 500; z2 = 60;

%t Table[s[n], {n, 1, 30}] (* A001519 *)

%t u[m_] := u[m] = Flatten[Table[s[k] - s[j], {k, 2, z1}, {j, 1, k - 1}]][[m]]

%t Table[u[m], {m, 1, z1}] (* A205371 *)

%t v[n_, h_] := v[n, h] = If[IntegerQ[u[h]/n], h, 0]

%t w[n_] := w[n] = Table[v[n, h], {h, 1, z1}]

%t d[n_] := d[n] = First[Delete[w[n], Position[w[n], 0]]]

%t Table[d[n], {n, 1, z2}] (* A205441 *)

%t k[n_] := k[n] = Floor[(3 + Sqrt[8 d[n] - 1])/2]

%t m[n_] := m[n] = Floor[(-1 + Sqrt[8 n - 7])/2]

%t j[n_] := j[n] = d[n] - m[d[n]] (m[d[n]] + 1)/2

%t Table[k[n], {n, 1, z2}] (* A205442 *)

%t Table[j[n], {n, 1, z2}] (* A205443 *)

%t Table[s[k[n]], {n, 1, z2}] (* A205444 *)

%t Table[s[j[n]], {n, 1, z2}] (* A205445 *)

%t Table[s[k[n]] - s[j[n]], {n, 1, z2}] (* A205446 *)

%t Table[(s[k[n]] - s[j[n]])/n, {n, 1, z2}] (* A205447 *)

%Y Cf. A001519, A205447, A204892.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 27 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 27 06:50 EDT 2024. Contains 375462 sequences. (Running on oeis4.)