A205873 - OEIS

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

A205873

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

3, 1, 5, 5, 10, 5, 10, 12, 8, 6, 1, 9, 4, 15, 2, 5, 10, 12, 13, 1, 9, 17, 11, 1, 9, 17, 22, 1, 9, 17, 22, 24, 2, 20, 3, 7, 4, 18, 5, 10, 12, 13, 21, 6, 16, 3, 7, 27, 8, 14 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,1`
	COMMENTS	`For a guide to related sequences, see A205840.`
	LINKS	`Table of n, a(n) for n=1..50.`
	EXAMPLE	`(See the example at A205872.)`
	MATHEMATICA	`(See the program at A205872.)`
	CROSSREFS	`Cf. A204890, A205872, A205840.` `Sequence in context: A124741 A339419 A213952 * A220479 A146913 A146252` `Adjacent sequences: A205870 A205871 A205872 * A205874 A205875 A205876`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling, Feb 02 2012`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 9 15:33 EDT 2022. Contains 356026 sequences. (Running on oeis4.)