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

%I #8 Mar 30 2012 18:58:12

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

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

%N The least number j such that 3 divides s(k)-s(j), where k(n)=A205842(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 A205842.)

%t (See the program at A205842.)

%Y Cf. A204890, A205842, A205845.

%K nonn

%O 1,1

%A _Clark Kimberling_, Feb 01 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 16:16 EDT 2024. Contains 374388 sequences. (Running on oeis4.)