id:A083552 - OEIS Search Results

Search: id:A083552

Displaying 1-1 of 1 results found.

page 1

Quotient when lcm of 2 consecutive prime differences is divided by gcd of the same two differences.

+0
1

2, 1, 2, 2, 2, 2, 2, 6, 3, 3, 6, 2, 2, 6, 1, 3, 3, 6, 2, 3, 6, 6, 12, 2, 2, 2, 2, 2, 14, 14, 6, 3, 5, 5, 3, 1, 6, 6, 1, 3, 5, 5, 2, 2, 6, 1, 3, 2, 2, 6, 3, 5, 15, 1, 1, 3, 3, 6, 2, 5, 35, 14, 2, 2, 14, 21, 15, 5, 2, 6, 12, 12, 1, 6, 6, 12, 2, 2, 20, 5, 5, 5, 3, 6, 6, 12, 2, 2, 2, 3, 6, 2, 2, 2, 6, 2, 6, 9 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=lcm(A001223[n], A001223[n+1])/gcd(A001223[n], A001223[n+1])= A083551[n]/A057467[n].`
	MATHEMATICA	`f[x_] := Prime[x+1]-Prime[x] Table[LCM[f[w+1], f[w]]/GCD[f[w+1], f[w]], {w, 1, 128}]`
	CROSSREFS	`Cf. A001223, A083538-A083555, A057467.` `Sequence in context: A105223 A025859 A031281 this_sequence A078704 A032358 A011960` `Adjacent sequences: A083549 A083550 A083551 this_sequence A083553 A083554 A083555`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), May 22 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research