id:A100375 - OEIS Search Results

Search: id:A100375

Displaying 1-1 of 1 results found.

page 1

a(n) = n-th consecutive-prime-difference divided by the largest power of 2 which divides it.

+0
1

1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 3, 1, 3, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 7, 1, 3, 1, 5, 1, 3, 3, 1, 3, 3, 1, 5, 1, 1, 1, 3, 3, 1, 1, 1, 3, 1, 5, 3, 3, 3, 1, 3, 1, 1, 5, 7, 1, 1, 1, 7, 3, 5, 1, 1, 3, 1, 3, 3, 1, 3, 1, 1, 1, 5, 1, 5, 1, 3, 1, 3, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 3, 1, 9, 3, 5, 3, 3, 1, 3 (list; graph; listen)

	OFFSET	`1,9`
	FORMULA	`a[n]=A001223(n)/A006519[A001223(n)]`
	MATHEMATICA	`t1=Table[Prime[n+1]-Prime[n], {n, 1, 256}]; t2=Table[GCD[Prime[n+1]-Prime[n], 65536], {n, 1, 256}]; t1/t2`
	CROSSREFS	`Cf. A006519, A001223, A100374.` `Adjacent sequences: A100372 A100373 A100374 this_sequence A100376 A100377 A100378` `Sequence in context: A095346 A060839 A088204 this_sequence A066975 A098877 A091088`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Dec 03 2004`

page 1

Search completed in 0.002 seconds

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.

AT&T Labs Research