id:A063086 - OEIS Search Results

Search: id:A063086

Displaying 1-1 of 1 results found.

page 1

GCD[1+p(n+1),1+p(n)] where p(n) is the n-th prime.

+0
1

1, 2, 2, 4, 2, 2, 2, 4, 6, 2, 2, 2, 2, 4, 6, 6, 2, 2, 4, 2, 2, 4, 6, 2, 2, 2, 4, 2, 2, 2, 4, 6, 2, 10, 2, 2, 2, 4, 6, 6, 2, 2, 2, 2, 2, 4, 4, 4, 2, 2, 6, 2, 2, 6, 6, 6, 2, 2, 2, 2, 2, 14, 4, 2, 2, 2, 2, 2, 2, 2, 6, 8, 2, 2, 4, 6, 2, 2, 2, 10, 2, 2, 2, 2, 4, 6, 2, 2, 2, 4, 12, 8, 4, 4, 4, 6, 6, 2, 2, 2, 2, 6 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Harry J. Smith, Table of n, a(n) for n=1,...,1000`
	EXAMPLE	`n=34, GCD[1+139,1+149]=10=a(34)`
	PROGRAM	`(PARI) { for (n=1, 1000, write("b063086.txt", n, " ", gcd(1 + prime(n+1), 1 + prime(n))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 17 2009]`
	CROSSREFS	`A058263.` `Sequence in context: A097884 A094818 A114233 this_sequence A077636 A057000 A090047` `Adjacent sequences: A063083 A063084 A063085 this_sequence A063087 A063088 A063089`
	KEYWORD	`easy,nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Aug 06 2001`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research