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!)
A349260 a(n) is the least number k such that A349258(k) = n. 2

%I #7 Nov 12 2021 20:04:57

%S 1,2,6,8,24,120,216,128,384,1920,3456,17280,120960,432000,279936,

%T 32768,98304,491520,884736,4423680,30965760,110592000,71663616,

%U 358318080,2508226560,8957952000,62705664000,689762304000,3072577536000,5598720000000,470184984576,2147483648

%N a(n) is the least number k such that A349258(k) = n.

%H Amiram Eldar, <a href="/A349260/b349260.txt">Table of n, a(n) for n = 0..111</a>

%e a(2) = 6 since A349258(6) = 2 and A349258(k) != 2 for all k < 6.

%t f[p_, e_] := 2^DigitCount[e, 2, 1] - 1; d[1] = 0; d[n_] := Plus @@ f @@@ FactorInteger[n]; seq[len_, nmax_] := Module[{s = Table[0, {len}], k = 0, n = 1, i}, While[k < len && n < nmax, i = d[n] + 1; If[i <= len && s[[i]] == 0, k++; s[[i]] = n]; n++]; TakeWhile[s, # > 0 &]]; seq[15, 10^6]

%Y Cf. A349258, A349259.

%K nonn

%O 0,2

%A _Amiram Eldar_, Nov 12 2021

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 August 11 01:05 EDT 2024. Contains 375059 sequences. (Running on oeis4.)