OFFSET
1,2
COMMENTS
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
a196564 n = length [d | d <- show n, d `elem` "13579"]
a196564_list = map a196564 [0..]
-- 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
KEYWORD
nonn,base,easy
AUTHOR
R. Muller
STATUS
approved