id:A110917 - OEIS Search Results

Search: id:A110917

Displaying 1-1 of 1 results found.

page 1

Conversion to a regular-simple continued-fraction approximation of the limit value (C0=2.774596381636004053708753998963780211275369098508432957319128835754771409356068438727613439124577996...) of the continued fraction (numerator = A110976 and denominator = A110977) based on the sequence of the distances of n from closest primes (A051699).

+0
1

2, 1, 3, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 4, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 4, 5, 6, 7, 6, 5, 4, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 4, 5, 4, 3, 2, 3, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 3, 4, 5 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`With the exception of n = 3, it should be abs(a(n)-a(n-1)) = < 1 for all n. Hill-mountain-like plot, with land = 2.`
	FORMULA	`see program`
	EXAMPLE	`C0 = a(1) +1/( a(2) +1/( a(3) +1/( a(4) +1/( a(5) +...=2+1/(1+1/(3+1/(2+1/(3+...`
	MAPLE	`cd:=proc(N) # d[n]distance of n from closest prime A[0]:=d[0]; A[1]:=d[1]A[0]+1; B[0]:=1; B[1]:=d[1]B[0]; for n from 2 by 1 to N do A[n]:=d[n]A[n-1]+A[n-2]; B[n]:=d[n]B[n-1]+B[n-2]; od; R:=A[N]/B[N]; convert(R, confrac); end:`
	CROSSREFS	`Cf. A051699, A110976, A110977.` `Sequence in context: A026730 A075256 A001480 this_sequence A070956 A007828 A070804` `Adjacent sequences: A110914 A110915 A110916 this_sequence A110918 A110919 A110920`
	KEYWORD	`cofr,nonn`
	AUTHOR	`Giorgio Balzarotti and Paolo P. Lava (greenblue(AT)tiscali.it), Oct 04 2005`

page 1

Search completed in 0.005 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research