id:A069104 - OEIS Search Results

Search: id:A069104

Displaying 1-1 of 1 results found.

page 1

Numbers n such that n divides F(n+1) where F(k) are the Fibonacci numbers.

+0
3

1, 2, 3, 7, 13, 17, 23, 37, 43, 47, 53, 67, 73, 83, 97, 103, 107, 113, 127, 137, 157, 163, 167, 173, 193, 197, 223, 227, 233, 257, 263, 277, 283, 293, 307, 313, 317, 323, 337, 347, 353, 367, 373, 377, 383, 397, 433, 443, 457, 463, 467, 487, 503, 523, 547, 557 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Equals A003631 union A069107` `Let u(1)=u(2)=1 and (n+2)u(n+2) = (n+1)u(n+1)+ n*u(n); then sequence gives values of k such that u(k) is an integer.`
	MATHEMATICA	`Select[Range[6! ], IntegerQ[Fibonacci[ #+1]/# ]&] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 03 2009]`
	CROSSREFS	`Sequence in context: A045328 A045329 A106306 this_sequence A003631 A032449 A129941` `Adjacent sequences: A069101 A069102 A069103 this_sequence A069105 A069106 A069107`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 06 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research