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!)
A205848 The least number j such that 4 divides s(k)-s(j), where k(n)=A205847(n) and s(k) denotes the (k+1)-st Fibonacci number. 4

%I

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

%T 10,12,13,5,11,1,4,6,7,10,12,13,16,1,4,6,7,10,12,13,16,18,2,8,14,3,9,

%U 15

%N The least number j such that 4 divides s(k)-s(j), where k(n)=A205847(n) and s(k) denotes the (k+1)-st Fibonacci number.

%C For a guide to related sequences, see A205840.

%e (See the example at A205847.)

%t (See the program at A205847.)

%Y Cf. A204890, A205847, A205850.

%K nonn

%O 1,3

%A _Clark Kimberling_, Feb 02 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 May 21 00:36 EDT 2022. Contains 353886 sequences. (Running on oeis4.)