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”).

A285705
a(n) = 2*n - A285703(n) = 2*n - A000203(A064216(n)).
5
1, 1, 2, 2, 3, 4, 2, 4, 4, 2, 4, 4, 13, 13, 6, 2, 10, 12, 6, 4, 4, 2, 18, 4, 19, 10, 6, 24, 4, 6, 2, 22, 18, 6, 10, 4, 2, 37, 30, 6, 51, 4, 30, 16, 6, 20, 4, 24, 8, 44, 4, 2, 34, 4, 2, 16, 4, 36, 34, 36, 65, 10, 86, 14, 4, 4, 26, 76, 6, 2, 10, 48, 50, 55, 10, 2, 56, 36, 6, 16, 42, 6, 70, 4, 37, 46, 6, 98, 16, 6, 2, 4, 58, 76, 100, 10, 2, 52, 4, 2, 16, 60, 54
OFFSET
1,3
COMMENTS
Question: Are all terms positive? - Yes, they are, see A286385. (Note added Jul 24 2022).
For listening: fast tempo and percussive instrument, default "modulo 88" pitch mapping, all 10000 terms.
LINKS
FORMULA
a(n) = 2*n - A285703(n) = 2*n - A000203(A064216(n)).
a(n) = 1 + A286385(A064216(n)). - Antti Karttunen, Jul 24 2022
Sum_{k=1..n} a(k) ~ c * n^2, where c = 1 - Product_{p prime} (p^3/((p+1)*(p^2-q(p)))) = 0.1831523243..., where q(p) = prevprime(p) (A151799) if p > 2 and q(2) = 1. - Amiram Eldar, Dec 21 2023
MATHEMATICA
Table[2 n - DivisorSigma[1, #] &@ If[n == 1, 1, Apply[Times, FactorInteger[2 n - 1] /. {p_, e_} /; p > 2 :> NextPrime[p, -1]^e]], {n, 103}] (* Michael De Vlieger, Apr 26 2017 *)
PROG
(PARI)
A064989(n) = { my(f = factor(n)); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f); };
A285705(n) = (n+n - sigma(A064989(n+n-1))); \\ Antti Karttunen, Jul 24 2022
(Scheme) (define (A285705 n) (- (* 2 n) (A285703 n)))
KEYWORD
nonn,hear
AUTHOR
Antti Karttunen, Apr 26 2017
STATUS
approved