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

A072748
Counting factor 3 in the first n squarefree numbers.
5
0, 0, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 15, 15, 15, 15, 15, 16, 16, 17, 17, 17, 17, 17, 18, 18, 19, 19, 19, 19, 19, 20, 20, 21, 21
OFFSET
1,5
LINKS
FORMULA
a(n) ~ n/4. - Amiram Eldar, Feb 24 2021
EXAMPLE
The first 10 squarefree numbers are: 1, 2, 3, 5, 6=2*3, 7, 10=2*5, 11, 13 and 14=2*7: 3 and 6 are divisible by 3, therefore a(10)=2.
MATHEMATICA
Accumulate[If[Divisible[#, 3], 1, 0]&/@Select[Range[100], SquareFreeQ]] (* Vincenzo Librandi, Aug 23 2015 *)
PROG
(PARI)
n = 80; k = 0; bag = List(); a = vector(n);
until(n == 0, k++; if (issquarefree(k), listput(bag, k); n--));
for (i=2, #bag, a[i] = a[i-1] + (bag[i] % 3 == 0));
print(a); \\ Gheorghe Coserea, Aug 22 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jul 08 2002
EXTENSIONS
Name clarified by Gheorghe Coserea, Aug 22 2015
STATUS
approved