id:A082892 - OEIS Search Results

Search: id:A082892

Displaying 1-1 of 1 results found.

page 1

Floor[q[j]], where q[j]=2j/log[A000230(j)]; log is natural logarithm, 2j-s are prime gaps>1, A000230(j) is the minimal lesser prime opening the consecutive prime distance equals 2j.

+0
2

1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 4, 5, 5, 5, 5, 5, 5, 5, 6, 5, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 7, 8, 8, 8, 7, 8, 8, 8, 9, 8, 8, 9, 8, 8, 8, 9, 10, 9, 9, 10, 9, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 9, 10, 10, 10, 10, 10, 11 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`For these larger and larger gap-initiating primes, integer part of relevant quotient,q, may exceed 27, all values between 1 and 28 occur. Observation supports conjecture that that infsup[q] is infinity`
	MAPLE	`t=A000230 list; Table[Floor[2*j/Log[Part[t, j]]//N], {j, 1, Length[t]}]`
	CROSSREFS	`Cf. A000230, A082862, A082884-A082891.` `Sequence in context: A015718 A008350 A019556 this_sequence A025839 A053261 A123584` `Adjacent sequences: A082889 A082890 A082891 this_sequence A082893 A082894 A082895`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 17 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research