This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A261189 Integers such that no subsequence of decimal representation is divisible by 5. 1
 1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 21, 22, 23, 24, 26, 27, 28, 29, 31, 32, 33, 34, 36, 37, 38, 39, 41, 42, 43, 44, 46, 47, 48, 49, 61, 62, 63, 64, 66, 67, 68, 69, 71, 72, 73, 74, 76, 77, 78, 79, 81, 82, 83, 84, 86, 87, 88, 89, 91, 92, 93, 94, 96, 97, 98, 99, 111, 112, 113, 114, 116, 117, 118, 119, 121 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Or, integers with no decimal digits 0 and 5 (see 2nd Mma). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 MATHEMATICA (*1*)Reap[Do[Le=Length[id=IntegerDigits[n]]; If[Min[Mod[Flatten[Table[FromDigits[Take[id, {x, y}]], {x, Le}, {y, x, Le}]], 5]]>0, Sow[n]], {n, 199}]][[2, 1]] (*2*)Reap[Do[id=IntegerDigits[n]; If[Intersection[id, {0, 5}]== {}, Sow[n]], {n, 199}]][[2, 1]] PROG (PARI) a(n)=fromdigits(apply(d->if(d>3, d+1, d), digits(n-1, 8)))+1 \\ Charles R Greathouse IV, Aug 11 2015 (Haskell) import Data.List.Ordered (isect) a261189 n = a261189_list !! (n-1) a261189_list = a052382_list `isect` a052413_list -- Reinhard Zumkeller, Aug 13 2015 CROSSREFS Cf. A114922, A261188. Intersection of A052382 and A052413. Sequence in context: A039116 A047201 A225496 * A023721 A087066 A120518 Adjacent sequences:  A261186 A261187 A261188 * A261190 A261191 A261192 KEYWORD nonn,base,easy AUTHOR Zak Seidov, Aug 11 2015 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 20 17:20 EDT 2018. Contains 316392 sequences. (Running on oeis4.)