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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Feb 15 2017 00:28:47
%S 11,33,55,77,99,319,517,539,715,737,759,913,935,957,979,1111,1133,
%T 1155,1177,1199,1331,1353,1375,1397,1551,1573,1595,1771,1793,1991,
%U 3113,3135,3157,3179,3311,3333,3355,3377,3399,3531,3553,3575,3597,3751,3773,3795
%N Multiples of 11 having only odd digits.
%H Harvey P. Dale, <a href="/A061833/b061833.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%e 1353 = 11*123 is a term having all odd digits.
%t Select[11*Range[400],AllTrue[IntegerDigits[#],OddQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Aug 30 2015 *)
%o (PARI) is(n)=n%22==11 && #setintersect(Set(digits(n)), [0,2,4,6,8])==0 \\ _Charles R Greathouse IV_, Feb 15 2017
%Y Cf. A061829-A061832.
%K nonn,base,easy
%O 1,1
%A _Amarnath Murthy_, May 29 2001
%E Corrected and extended by Larry Reeves (larryr(AT)acm.org), May 30 2001