Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)
A134361 a(n) = smallest integer >= n which has only prime factors 2 and 3. 4

%I #10 Jul 09 2021 12:10:34

%S 1,2,3,4,6,6,8,8,9,12,12,12,16,16,16,16,18,18,24,24,24,24,24,24,27,27,

%T 27,32,32,32,32,32,36,36,36,36,48,48,48,48,48,48,48,48,48,48,48,48,54,

%U 54,54,54,54,54,64,64,64,64,64,64,64,64,64,64,72,72,72,72,72,72,72,72

%N a(n) = smallest integer >= n which has only prime factors 2 and 3.

%C Can be used, for example, to derive A084788 and A084790 from A084789. - _Charles R Greathouse IV_, Jul 09 2021

%t With[{pf23=Union[Flatten[Table[Times@@@Tuples[{2,3},n],{n,0,6}]]]}, Flatten[Table[Select[pf23,#>=n&,1],{n,80}]]] (* _Harvey P. Dale_, Mar 07 2012 *)

%o (R) f <- function(n) nextn(n, factors = c(2,3))

%o a <- matrix(1:256,ncol=1)

%o apply(a,1,f)

%o (PARI) a(n)=my(v=List()); for(i=0,logint(n,3)+1, my(t=3^i); t<<=if(t>n, 0, exponent(n\t)+1); listput(v,t)); Set(v)[1] \\ _Charles R Greathouse IV_, Jul 09 2021

%Y Cf. A130916, A134361, A151969.

%K nonn,easy

%O 1,2

%A _N. J. A. Sloane_, Aug 23 2009; corrected Mar 07 2012

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 18 23:05 EDT 2024. Contains 375284 sequences. (Running on oeis4.)