id:A069929 - OEIS Search Results

Search: id:A069929

Displaying 1-1 of 1 results found.

page 1

Number of k, 1<=k<=n, such that k^3+1 divides n^3+1.

+0
1

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

	OFFSET	`1,3`
	FORMULA	`Conjecture : (1/n)sum(k=1, n, a(k)) = Cln(ln(n))+o(ln(ln(n)) with 1<C<3/2`
	PROGRAM	`(PARI) for(n=1, 150, print1(sum(i=1, n, if((n^3+1)%(i^3+1), 0, 1)), ", "))`
	CROSSREFS	`Cf. A066743.` `Sequence in context: A059127 A105609 A101872 this_sequence A101312 A035942 A036989` `Adjacent sequences: A069926 A069927 A069928 this_sequence A069930 A069931 A069932`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), May 05 2002`

page 1

Search completed in 0.002 seconds

Last modified September 5 19:27 EDT 2008. Contains 143485 sequences.

AT&T Labs Research