id:A066752 - OEIS Search Results

Search: id:A066752

Displaying 1-1 of 1 results found.

page 1

a(n) = GCD(prime(n)+1, n+1).

+0
3

1, 1, 2, 1, 6, 7, 2, 1, 2, 1, 4, 1, 14, 1, 16, 1, 6, 1, 4, 3, 2, 1, 12, 5, 2, 3, 4, 1, 10, 1, 32, 33, 2, 35, 6, 1, 2, 1, 8, 1, 6, 1, 4, 1, 2, 1, 4, 7, 2, 1, 26, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 21, 4, 13, 2, 1, 4, 1, 2, 1, 6, 1, 2, 1, 76, 1, 78, 1, 2, 1, 2, 1, 12, 1, 2, 3, 2, 1, 6, 1, 4, 3, 2, 1, 4, 1, 2, 9, 4 (list; graph; listen)

	OFFSET	`1,3`
	EXAMPLE	`a(23) = GCD(prime(23)+1,23+1) = GCD(83+1,24) = GCD(84,24) = 12*GCD(7,2) = 12.`
	MATHEMATICA	`Table[GCD[Prime[w]+1, w+1], {w, 1, 128}]`
	CROSSREFS	`Cf. A000040.` `Cf. A084309-A084316.` `Sequence in context: A019082 A052636 A084312 this_sequence A059364 A160348 A047708` `Adjacent sequences: A066749 A066750 A066751 this_sequence A066753 A066754 A066755`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 16, 2002`
	EXTENSIONS	`More terms from Labos E. (labos(AT)ana.sote.hu), Jun 13 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research