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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A164898 First differences of numbers having only odd digits in their decimal representation. 3
 2, 2, 2, 2, 2, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 112, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 112, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12, 2, 2, 2, 2, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = A014261(n+1) - A014261(n); all terms are of the form (10^k + 8)/9, see A047855; a(n) > 2 iff A014261(n) mod 10 = 9. LINKS Robert Israel, Table of n, a(n) for n = 1..10000 MAPLE R[1]:= [1, 3, 5, 7, 9]: for d from 2 to 3 do R[d]:= map(t -> seq(10*t+i, i=[1, 3, 5, 7, 9]), R[d-1]) od: B:= map(op, [seq(R[d], d=1..3)]): B[2..-1]-B[1..-2]; # Robert Israel, Jan 24 2022 MATHEMATICA Differences[Select[Range[1000], Count[IntegerDigits[#], _?EvenQ]==0&]] (* Harvey P. Dale, Jan 03 2019 *) CROSSREFS Cf. A014261. Sequence in context: A252375 A339170 A257773 * A100801 A194310 A306227 Adjacent sequences: A164895 A164896 A164897 * A164899 A164900 A164901 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Aug 30 2009 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 8 14:30 EST 2023. Contains 367679 sequences. (Running on oeis4.)