login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069929 Number of k, 1<=k<=n, such that k^3+1 divides n^3+1. 0
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; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..105.

FORMULA

Conjecture: (1/n)*Sum_{k=1..n} a(k) = C*log(log(n)) + o(log(log(n)) with 1 < C < 3/2.

PROG

(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: A101872 A251659 A174892 * A101312 A241273 A154263

Adjacent sequences:  A069926 A069927 A069928 * A069930 A069931 A069932

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre, May 05 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 09:18 EST 2016. Contains 278775 sequences.