The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A007957 Numbers that contain an odd digit. 4
 1, 3, 5, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 23, 25, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 43, 45, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 63, 65, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 81, 83, 85, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Complement of A014263; a196564(a(n)) > 0; A103181(a(n)) > 0. - Reinhard Zumkeller, Oct 04 2011 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 F. Smarandache, Only Problems, Not Solutions!, Xiquan Publ., Phoenix-Chicago, 1993. FORMULA a(n) = n + O(n^0.69897...) where the constant is A153268. - Charles R Greathouse IV, Jul 25 2012 MATHEMATICA Select[Range[100], Count[IntegerDigits[#], _?OddQ]>0&] (* Harvey P. Dale, Sep 06 2017 *) PROG (Haskell) import Data.List findIndices) a007957 n = a007957_list !! (n-1) a007957_list = findIndices (> 0) a196564_list -- Reinhard Zumkeller, Oct 04 2011 (PARI) is(n)=my(v=vecsort(eval(Vec(Str(n)))%2, , 8)); v[#v] \\ Charles R Greathouse IV, Jul 25 2012 CROSSREFS Sequence in context: A249494 A079377 A047747 * A194377 A258432 A128938 Adjacent sequences:  A007954 A007955 A007956 * A007958 A007959 A007960 KEYWORD nonn,base,easy AUTHOR R. Muller STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 23 22:36 EST 2020. Contains 331177 sequences. (Running on oeis4.)