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!)
 A182211 The number of integers k < 10^n such that both k and k^3 mod 10^n have all odd decimal digits. 0
 5, 25, 62, 151, 381, 833, 2163, 5291, 13317, 33519, 85179, 213083, 539212, 1344272, 3358571 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Inspired by a discussion on the math-fun list on April 18, 2012 by James R. Buddenhagen. LINKS PROG (Haskell) oddDigits 0 = True oddDigits n = let (q, r) = quotRem n 10 ..............in (odd r) && oddDigits q oddSet 0 = [] oddSet 1 = [1, 3..9] oddSet k = [n | i <- [1, 3..9], x <- oddSet (k-1), let n = i*10^(k-1) + x, ...............oddDigits((n^3) `mod` 10^k)] main = putStrLn \$ map (length . oddSet) [1..] CROSSREFS Cf. A085597 (n such that both n and n^3 have all odd digits). Sequence in context: A152734 A080856 A060820 * A146404 A323187 A179131 Adjacent sequences: A182208 A182209 A182210 * A182212 A182213 A182214 KEYWORD nonn,base AUTHOR Victor S. Miller, Apr 18 2012 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 1 23:44 EST 2022. Contains 358485 sequences. (Running on oeis4.)