login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072749 Count of factors of 5 in the first n squarefree numbers. 5
0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

LINKS

Gheorghe Coserea, Table of n, a(n) for n = 1..10000

EXAMPLE

The first 10 squarefree numbers are: 1, 2, 3, 5, 6=2*3, 7, 10=2*5, 11, 13 and 14=2*7: 5 and 10 are divisible by 5, therefore a(10)=2.

MATHEMATICA

Accumulate[If[Divisible[#, 5], 1, 0]&/@Select[Range[150], SquareFreeQ]] (* Harvey P. Dale, Oct 17 2013 *)

PROG

(PARI)

n = 89; 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] % 5 == 0));

print(a); \\ Gheorghe Coserea, Aug 22 2015

CROSSREFS

Cf. A005117, A072747, A072748, A072750, A072751.

Sequence in context: A000523 A124156 A324965 * A066490 A156685 A124230

Adjacent sequences:  A072746 A072747 A072748 * A072750 A072751 A072752

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jul 08 2002

EXTENSIONS

Name clarified by Gheorghe Coserea, Aug 22 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 7 04:20 EDT 2020. Contains 333292 sequences. (Running on oeis4.)