id:A116514 - OEIS Search Results

Search: id:A116514

Displaying 1-1 of 1 results found.

page 1

a(n) = (p - (5|p)) divided by the smallest m such that p divides Fibonacci(m), where p is the n-th prime and (5|p) is the Legendre symbol.

+0
1

1, 1, 1, 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, 3, 2, 1, 4, 1, 1, 2, 1, 1, 8, 2, 2, 1, 3, 4, 6, 1, 1, 2, 3, 4, 3, 2, 1, 1, 2, 1, 2, 1, 2, 2, 9, 5, 1, 1, 2, 18, 1, 2, 1, 2, 3, 4, 1, 2, 10, 1, 2, 7, 1, 2, 2, 3, 2, 3, 2, 6, 1, 1, 2, 1, 1, 4, 2, 4, 2, 1, 20, 1, 2, 1, 1, 2, 2, 10, 1, 1, 1, 1, 1, 1, 1, 2, 20, 1, 6, 1, 18, 3 (list; graph; listen)

	OFFSET	`2,5`
	COMMENT	`Lucas showed that A001602 divides p-1 or p+1, according as (5\|p) = 1 or -1 respectively, this is the quotient.`
	FORMULA	`(p_n - (5\|p_n)) / A001602(n)`
	EXAMPLE	`a(6) = 2, as 13 is the 6th prime, 5 is not a quadratic residue mod 13, 13 first occurs as a prime factor of Fibonacci(7) and (13 - (-1)) / 7 = 2.`
	CROSSREFS	`Cf. A001602.` `Sequence in context: A078880 A000002 A074295 this_sequence A124767 A112933 A088427` `Adjacent sequences: A116511 A116512 A116513 this_sequence A116515 A116516 A116517`
	KEYWORD	`easy,nonn`
	AUTHOR	`Nick Krempel (ndkrempel(AT)blueyonder.co.uk), Mar 24 2006`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research