login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A076142
a(n) = A064097(n) - A003313(n).
8
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2
OFFSET
1,129
COMMENTS
The positions where k = 0, 1, 2, ... occur for the first time are 1, 23, 129, 517, 2049, 4613, 33097, 33793, ... factorized as: 1, 23, 3*43, 11*47, 3*683, 7*659, 23*1439, 47*719, ... - Antti Karttunen, Aug 18 2017
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000 (also based on the b-file of A003313)
FORMULA
It seems that sum(k = 1, n, a(k)) * log(n)/n^2 -> c (0.006 < c < 0.01).
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Oct 31 2002
EXTENSIONS
Extended to 129 terms by Antti Karttunen, Aug 18 2017
STATUS
approved