id:A071222 - OEIS Search Results

Search: id:A071222

Displaying 1-1 of 1 results found.

page 1

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

+0
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; listen)

	OFFSET	`1,1`
	PROGRAM	`(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 this_sequence A067005 A135517 A164799` `Adjacent sequences: A071219 A071220 A071221 this_sequence A071223 A071224 A071225`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 10 2002`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research