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!)
A205114 Least k such that n divides L(k)-L(j) for some j satisfying 1<=j<k, where L(j) is the j-th Lucas number (A000032). 9

%I #12 Mar 24 2015 06:07:55

%S 2,2,3,4,5,4,5,5,7,5,6,8,7,6,6,10,6,7,10,8,10,7,8,9,7,7,16,7,8,10,16,

%T 11,11,11,10,8,13,10,11,8,11,14,8,8,12,8,9,11,11,16,13,13,12,16,12,10,

%U 17,9,14,10

%N Least k such that n divides L(k)-L(j) for some j satisfying 1<=j<k, where L(j) is the j-th Lucas number (A000032).

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

%t s[n_] := s[n] = LucasL[n]; z1 = 500; z2 = 60;

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

%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}] (* A205112 *)

%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}] (* A205113 *)

%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}] (* A205114 *)

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

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

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

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

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

%Y Cf. A000032, A204892, A205119.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 22 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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)