id:A066743 - OEIS Search Results

Search: id:A066743

Displaying 1-1 of 1 results found.

page 1

a(n) is the number of integers of the form (n^2+1)/(k^2+1) k=1,2,3,...,n.

+0
4

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

	OFFSET	`1,3`
	FORMULA	`Conjecture: (1/n)sum(i=1, n, a(i))=cln(ln(n)) asymptotically with 1<c<2.`
	MATHEMATICA	`a[ n_ ] := Length[ Select[ Range[ 1, n ], IntegerQ[ (n^2+1)/(#^2+1) ]& ] ]`
	CROSSREFS	`Sequence in context: A029329 A166866 A124036 this_sequence A046645 A016470 A059807` `Adjacent sequences: A066740 A066741 A066742 this_sequence A066744 A066745 A066746`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 16 2002`
	EXTENSIONS	`Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 20 2002`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research