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!)
A124510 Smallest m such that A124508(m) = A124509(n). 3

%I #13 Jul 11 2023 03:41:47

%S 1,2,4,8,6,16,12,32,24,64,30,48,128,60,96,256,120,192,210,512,240,384,

%T 420,1024,480,768,840,2048,960,2310,1536,1680,4096,1920,4620,3072,

%U 3360,8192,3840,9240,6144,6720,30030,16384,7680,18480,12288,13440,60060,32768,15360,36960,24576

%N Smallest m such that A124508(m) = A124509(n).

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

%F A124509(n) = A124508(a(n)).

%F A124508(k) <> A124508(a(n)) for k < a(n).

%F a(n) = A002110(e_3) * 2^(e_2-e_3), where e_2 = valuation(A124509(n), 2), and e_3 = valuation(A124509(n), 3).

%t f[n_] := Module[{e2 = IntegerExponent[n, 2], e3 = IntegerExponent[n, 3]}, Product[Prime[i], {i, 1, e3}] * 2^(e2 - e3)];

%t With[{max = 10^5}, f /@ Join[{1}, Sort[Flatten[Table[2^i*3^j, {i, 1, Log2[max]}, {j, 1, Min[i, Log[3, max/2^i]]}]]]]] (* _Amiram Eldar_, Jul 11 2023 *)

%Y Cf. A002110, A124508, A124509.

%K nonn,easy

%O 1,2

%A _Reinhard Zumkeller_, Nov 04 2006

%E Name corrected and missing terms inserted by _Amiram Eldar_, Jul 11 2023

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 April 23 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)