The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225838 Numbers of form 2^i*3^j*(6k+5), i, j, k >= 0. 6
 5, 10, 11, 15, 17, 20, 22, 23, 29, 30, 33, 34, 35, 40, 41, 44, 45, 46, 47, 51, 53, 58, 59, 60, 65, 66, 68, 69, 70, 71, 77, 80, 82, 83, 87, 88, 89, 90, 92, 94, 95, 99, 101, 102, 105, 106, 107, 113, 116, 118, 119, 120, 123, 125, 130, 131, 132, 135, 136, 137, 138 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Are a(n) > A225837(n) for all n? - Zak Seidov, May 17 2013 The asymptotic density of this sequence is 1/2. - Amiram Eldar, Apr 03 2022 LINKS Zak Seidov, Table of n, a(n) for n = 1..10000 MATHEMATICA mx = 153; t = {}; Do[n = 2^i*3^j (6 k + 5); If[n <= mx, AppendTo[t, n]], {i, 0, Log[2, mx]}, {j, 0, Log[3, mx]}, {k, 0, mx/6}]; Union[t] (* T. D. Noe, May 16 2013 *) PROG (PARI) for(n=1, 200, t=n/(2^valuation(n, 2)*3^valuation(n, 3)); if((t%6==5), print1(n, ", "))) (Magma) [n: n in [1..200] | d mod 6 eq 5 where d is n div (2^Valuation(n, 2)*3^Valuation(n, 3))]; // Bruno Berselli, May 16 2013 CROSSREFS Inverse of A225837. Sequence in context: A297132 A136823 A275200 * A036788 A351327 A136811 Adjacent sequences: A225835 A225836 A225837 * A225839 A225840 A225841 KEYWORD nonn,easy AUTHOR Ralf Stephan, May 16 2013 STATUS approved

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.

Last modified December 9 19:36 EST 2022. Contains 358703 sequences. (Running on oeis4.)