

A118290


a(1) = 1. a(n) = number of terms among the sequence's first (n1) terms which are divisible by the smallest prime dividing a(n1), or which are divisible by 1 if a(n1)= 1.


2



1, 1, 2, 1, 4, 2, 3, 1, 8, 4, 5, 1, 12, 6, 7, 1, 16, 8, 9, 4, 10, 11, 1, 23, 1, 25, 3, 5, 4, 12, 13, 1, 32, 14, 15, 7, 3, 8, 16, 17, 1, 41, 1, 43, 1, 45, 9, 10, 18, 19, 1, 51, 12, 20, 21, 14, 22, 23, 2, 24, 25, 9, 16, 26, 27, 17, 3, 18, 28, 29, 1, 71, 1, 73, 1, 75, 20, 30, 31
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

If a(n1) = 1, then a(n) = n1, obviously.


LINKS



EXAMPLE

a(13)= 12. So a(14) = the number of terms among the first 13 terms which are divisible by the lowest prime dividing 12 (which is 2).
a(3)=2, a(5)=4, a(6)=2, a(9)=8, a(10)=4 and a(13) = 12 are the six terms each divisible by 2, so a(14) = 6.


CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



