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

A082514
a(n) = pi(n) + tau(n).
1
1, 3, 4, 5, 5, 7, 6, 8, 7, 8, 7, 11, 8, 10, 10, 11, 9, 13, 10, 14, 12, 12, 11, 17, 12, 13, 13, 15, 12, 18, 13, 17, 15, 15, 15, 20, 14, 16, 16, 20, 15, 21, 16, 20, 20, 18, 17, 25, 18, 21, 19, 21, 18, 24, 20, 24, 20, 20, 19, 29, 20, 22, 24, 25, 22, 26, 21, 25, 23, 27, 22, 32, 23, 25
OFFSET
1,2
FORMULA
a(n) = A000720(n) + A000005(n).
MATHEMATICA
Table[DivisorSigma[0, w]+PrimePi[w], {w, 1, 128}]
PROG
(PARI) a(n) = primepi(n) + numdiv(n); \\ Michel Marcus, Dec 01 2021
KEYWORD
easy,nonn,less
AUTHOR
Labos Elemer, Apr 29 2003
EXTENSIONS
Name changed by Wesley Ivan Hurt, Nov 30 2021
STATUS
approved