cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A295164 Number of squarefree numbers m <= n that have a prime divisor greater than sqrt(n) (i.e., A006530(m) > sqrt(n)).

Original entry on oeis.org

0, 1, 2, 1, 2, 3, 4, 4, 2, 3, 4, 4, 5, 6, 7, 7, 8, 8, 9, 9, 10, 11, 12, 12, 9, 10, 10, 10, 11, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 19, 20, 21, 21, 21, 22, 23, 23, 18, 18, 19, 19, 20, 20, 21, 21, 22, 23, 24, 24, 25, 26, 26, 26, 27, 28, 29, 29, 30, 30, 31, 31, 32, 33, 33, 33, 34, 35, 36, 36, 36, 37, 38, 38, 39, 40, 41, 41, 42, 42, 43, 43, 44, 45, 46, 46, 47, 47, 47, 47
Offset: 1

Views

Author

Max Alekseyev, Nov 16 2017

Keywords

Crossrefs

Cf. A241419.

Formula

a(n) = Sum_{prime p > sqrt(n)} A013928(floor(n/p)+1).
a(n) = A013928(n+1) - A295101(n).