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!)
A349261 a(n) is the least number k such that A349258(k) = A349258(k+1) = n. 0

%I #8 Mar 09 2022 09:33:43

%S 2,14,125,135,2079,21735,2730375,916352,5955200,4122495,444741759,

%T 7391633535,98228219264

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

%e 2 is a term since A349258(2) = A349258(3) = 1.

%e 14 is a term since A349258(14) = A349258(15) = 2.

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

%Y Cf. A349258.

%Y Similar sequences: A075036, A093548, A115186, A343818.

%K nonn,more

%O 1,1

%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 September 14 20:23 EDT 2024. Contains 375929 sequences. (Running on oeis4.)