A071222 - OEIS

This site is supported by donations to The OEIS Foundation.

A071222

Smallest k such that gcd(n,k) = gcd(n+1,k+1).

2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	PROG	`(PARI) for(n=1, 140, s=1; while(gcd(s, n)<gcd(n+1, s+1), s++); print1(s, ", "))`
	CROSSREFS	`Sequence in context: A081169 A030359 A035400 * A067005 A135517 A164799` `Adjacent sequences: A071219 A071220 A071221 * A071223 A071224 A071225`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 10 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:58 EST 2012. Contains 205985 sequences.