id:A086382 - OEIS Search Results

Search: id:A086382

Displaying 1-1 of 1 results found.

page 1

k divides F(k*n^2+1)-F(k+1) for 1<=k<=a(n) where F(k) is the k-th Fibonacci number.

+0
1

2, 1, 2, 10, 1, 10, 2, 1, 2, 12, 1, 10, 2, 1, 2, 10, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 16, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 16, 1, 10, 2, 1, 2, 10, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 12, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 36, 1, 10, 2, 1, 2, 10, 1, 12, 2, 1, 2, 10, 1, 10, 2, 1, 2, 12, 1, 12 (list; graph; listen)

	OFFSET	`2,1`
	FORMULA	`a(3n)=1; a( A047235(n))=2`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, m=1; while((fibonacci(m*n^2+1)-fibonacci(m+1))%m==0, m++); m-1)`
	CROSSREFS	`Sequence in context: A022694 A002079 A078357 this_sequence A062345 A077098 A069238` `Adjacent sequences: A086379 A086380 A086381 this_sequence A086383 A086384 A086385`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 06 2003`

page 1

Search completed in 0.002 seconds

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.

AT&T Labs Research