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!)
Search: a134361 -id:a134361
Displaying 1-3 of 3 results found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A130916 a(n) = smallest integer >= n which has only prime factors 2, 3 and 5. +10
4
1, 2, 3, 4, 5, 6, 8, 8, 9, 10, 12, 12, 15, 15, 15, 16, 18, 18, 20, 20, 24, 24, 24, 24, 25, 27, 27, 30, 30, 30, 32, 32, 36, 36, 36, 36, 40, 40, 40, 40, 45, 45, 45, 45, 45, 48, 48, 48, 50, 50, 54, 54, 54, 54, 60, 60, 60, 60, 60, 60, 64, 64, 64, 64, 72, 72, 72, 72, 72 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This group of sequences is useful when looking for a number >= n to use as the basis for a Fast Fourier Transform when you have n data points.
LINKS
MATHEMATICA
si[n_]:=Module[{k=n}, While[Max[FactorInteger[k][[All, 1]]]>5, k++]; k]; Array[ si, 70] (* Harvey P. Dale, Oct 14 2019 *)
PROG
(R) f <- function(n) nextn(n, factors = c(2, 3, 5))
a <- matrix(1:256, ncol=1)
apply(a, 1, f)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Aug 23 2009
STATUS
approved
A151969 a(n) = smallest integer >= n which has only prime factors 2 and 5. +10
4
1, 2, 4, 4, 5, 8, 8, 8, 10, 10, 16, 16, 16, 16, 16, 16, 20, 20, 20, 20, 25, 25, 25, 25, 25, 32, 32, 32, 32, 32, 32, 32, 40, 40, 40, 40, 40, 40, 40, 40, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 80, 80, 80, 80, 80 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
Module[{upto=100, pwr, f25}, pwr=Ceiling[Log[2, upto]]; f25=Select[ Sort[ Flatten[ Table[Times@@@Union[Sort/@Tuples[{2, 5}, n]], {n, 0, pwr}]]], #<= upto&]; Table[SelectFirst[f25, #>i&], {i, 0, upto-1}]] (* The program uses the SelectFirst function from Mathematica version 10 *) (* Harvey P. Dale, Jan 28 2016 *)
PROG
(R) f <- function(n) nextn(n, factors = c(2, 5))
a <- matrix(1:256, ncol=1)
apply(a, 1, f)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Aug 23 2009
STATUS
approved
A151970 a(n) = smallest integer >= n which has only prime factors 3 and 5. +10
2
1, 3, 3, 5, 5, 9, 9, 9, 9, 15, 15, 15, 15, 15, 15, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 27, 27, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
PROG
(R) f <- function(n) nextn(n, factors = c(3, 5))
a <- matrix(1:256, ncol=1)
apply(a, 1, f)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Aug 23 2009; corrected Mar 07 2012
STATUS
approved
page 1

Search completed in 0.005 seconds

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.)