id:A058078 - OEIS Search Results

Search: id:A058078

Displaying 1-1 of 1 results found.

page 1

Least common divisor of 2 consecutive special binomial coefficients formed from consecutive primes: a(n)=GCD[C[p(n+2),p(n+1)],C[p(n+1),p(n)].

+0
1

1, 1, 3, 6, 2, 1, 1, 35, 15, 3, 2, 1, 3, 5, 14, 6, 6, 7, 1, 1, 5, 4, 4, 15, 3, 1, 2, 2, 55, 5, 4, 3, 1, 1, 3, 84, 1, 1, 28, 10, 3, 3, 1, 1, 1, 221, 3, 6, 2, 7, 3, 15, 231, 21, 7, 1, 5, 70, 3, 1, 1292, 35, 1, 3, 15, 24, 7, 1, 6, 7, 1, 3, 42, 5, 1, 231, 35, 1, 143, 2, 5, 1, 1, 7, 14, 1, 45, 3 (list; graph; listen)

	OFFSET	`0,3`
	EXAMPLE	`n=8, a(8)=GCD[C[p(10),p(9)],C[p(9),p(8)]]=GCD[C[29,23],C[23,19]]=GCD[8855,475020]=GCD[5.7.11.23, 4.9.13.29.5.7]=35`
	CROSSREFS	`Cf. A058077.` `Sequence in context: A094445 A004158 A058178 this_sequence A016551 A120907 A133358` `Adjacent sequences: A058075 A058076 A058077 this_sequence A058079 A058080 A058081`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Nov 13 2000`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research