id:A092386 - OEIS Search Results

Search: id:A092386

Displaying 1-1 of 1 results found.

page 1

Let p(n) = n-th prime; a(n) = largest prime factor of (p(n+1)^2-p(n)*p(n+2)).

+0
1

1, 2, 3, 5, 3, 7, 5, 11, 2, 7, 7, 5, 13, 7, 3, 31, 29, 79, 5, 7, 13, 71, 13, 7, 7, 11, 37, 7, 179, 17, 17, 7, 13, 101, 37, 3, 7, 31, 3, 13, 17, 43, 7, 67, 983, 3, 229, 11, 5, 17, 11, 53, 19, 3, 3, 17, 67, 17, 19, 17, 43, 521, 7, 103, 173, 683, 23, 233, 23, 31, 67, 23, 3, 23, 53, 73, 5 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(n)=A006530(A056221(n))`
	MATHEMATICA	`Table[ FactorInteger[Prime[n + 1]^2 - Prime[n]Prime[n + 2]][[ -1, 1]], {n, 80}] (from Robert G. Wilson v Mar 24 2004)`
	CROSSREFS	`Cf. A006530, A056221.` `Sequence in context: A117367 A080184 A052248 this_sequence A117369 A117366 A073482` `Adjacent sequences: A092383 A092384 A092385 this_sequence A092387 A092388 A092389`
	KEYWORD	`easy,nonn`
	AUTHOR	`Frank Schwellinger (nummer_eins(AT)web.de), Mar 20 2004`
	EXTENSIONS	`More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 24 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research