This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A294601 #17 Nov 07 2017 03:03:05 %S A294601 1,3,5,7,9,10,12,14,16,18,21,23,25,27,29,30,32,34,36,38,41,43,45,47, %T A294601 49,50,52,54,56,58,61,63,65,67,69,70,72,74,76,78,81,83,85,87,89,90,92, %U A294601 94,96,98,100,102,104,106,108,120,122,124,126,128,140,142,144,146,148,160,162,164,166,168,180 %N A294601 Numbers with exactly one odd decimal digit. %C A294601 First differs from A054684 at position 56. %C A294601 Numbers n such that A196564(n) = 1. - _Felix Fröhlich_, Nov 03 2017 %C A294601 There are (1+4*d)*5^(d-1) = 5*A081040(d+1) terms with d digits. - _Robert Israel_, Nov 06 2017 %H A294601 Robert Israel, <a href="/A294601/b294601.txt">Table of n, a(n) for n = 1..10000</a> %p A294601 Res:= NULL: %p A294601 for t from 0 to 1000 do %p A294601 if nops(select(type,convert(t,base,10),odd))=1 then Res:= Res,t fi %p A294601 od: %p A294601 Res; %t A294601 Select[Range@ 200, Count[IntegerDigits@ #, _?OddQ] == 1 &] (* _Michael De Vlieger_, Nov 03 2017 *) %o A294601 (PARI) a196564(n) = #select(x->x%2, digits(n)) \\ after _Michel Marcus_ %o A294601 is(n) = a196564(n)==1 \\ _Felix Fröhlich_, Nov 03 2017 %Y A294601 Cf. A014263, A054684, A081040, A196564, A275775. %K A294601 nonn,base,look %O A294601 1,2 %A A294601 _Robert Israel_, Nov 03 2017