login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A336064 Numbers divisible by the maximal exponent in their prime factorization (A051903). 7

%I #12 Jul 14 2020 03:38:39

%S 2,3,4,5,6,7,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,26,27,28,29,

%T 30,31,33,34,35,36,37,38,39,41,42,43,44,46,47,48,50,51,52,53,54,55,57,

%U 58,59,60,61,62,65,66,67,68,69,70,71,72,73,74,76,77,78,79

%N Numbers divisible by the maximal exponent in their prime factorization (A051903).

%C The asymptotic density of this sequence is A336065 = 0.848957... (Schinzel and Šalát, 1994).

%D József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, chapter 3, p. 331.

%H Amiram Eldar, <a href="/A336064/b336064.txt">Table of n, a(n) for n = 1..10000</a>

%H Andrzej Schinzel and Tibor Šalát, <a href="https://dml.cz/handle/10338.dmlcz/136624">Remarks on maximum and minimum exponents in factoring</a>, Mathematica Slovaca, Vol. 44, No. 5 (1994), pp. 505-514.

%e 4 = 2^2 is a term since A051903(4) = 2 is a divisor of 4.

%t H[1] = 0; H[n_] := Max[FactorInteger[n][[;; , 2]]]; Select[Range[2, 100], Divisible[#, H[#]] &]

%o (PARI) isok(m) = if (m>1, (m % vecmax(factor(m)[,2])) == 0); \\ _Michel Marcus_, Jul 08 2020

%Y Cf. A051903, A124184, A336065.

%Y A005117 (except for 1) is subsequence.

%Y Similar sequences: A033950, A005349, A006446, A074946, A075592, A007694, A112249, A336063.

%K nonn

%O 1,1

%A _Amiram Eldar_, Jul 07 2020

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 21 04:02 EDT 2024. Contains 374463 sequences. (Running on oeis4.)