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!)
A204928 s(k(n)) - s(j(n)), where (s(k(n)), s(j(n))) is the least pair of distinct Fibonacci numbers for which n divides s(k(n)) - s(j(n)). 4

%I #15 Mar 17 2022 01:11:59

%S 1,2,3,4,5,6,7,8,18,10,11,12,13,42,225,16,34,18,19,20,21,88,230,144,

%T 50,26,54,84,29,2550,31,32,33,34,17710,144,555,76,4173,2440,123,42,86,

%U 88,225,230,47,144,343,50,2550,52,53,54,55,2576,228,232,121304

%N s(k(n)) - s(j(n)), where (s(k(n)), s(j(n))) is the least pair of distinct Fibonacci numbers for which n divides s(k(n)) - s(j(n)).

%C The ordering of the pairs (s(k(n)), s(j(n))) is given by A204922. For a guide to related sequences, see A204892.

%H G. C. Greubel, <a href="/A204928/b204928.txt">Table of n, a(n) for n = 1..1000</a>

%t (See the program at A204924.)

%Y Cf. A204900, A204892, A204929.

%K nonn

%O 1,2

%A _Clark Kimberling_, Jan 21 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 July 18 15:51 EDT 2024. Contains 374388 sequences. (Running on oeis4.)