cp's OEIS Frontend

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.

A098945 Numbers where 1 is the only odd decimal digit.

This page as a plain text file.
%I A098945 #17 Mar 13 2022 16:15:19
%S A098945 1,10,11,12,14,16,18,21,41,61,81,100,101,102,104,106,108,110,111,112,
%T A098945 114,116,118,120,121,122,124,126,128,140,141,142,144,146,148,160,161,
%U A098945 162,164,166,168,180,181,182,184,186,188,201,210,211,212,214,216,218
%N A098945 Numbers where 1 is the only odd decimal digit.
%C A098945 This is a 10-automatic language. - _Charles R Greathouse IV_, Oct 05 2011
%H A098945 Robert Israel, <a href="/A098945/b098945.txt">Table of n, a(n) for n = 1..10000</a>
%H A098945 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>
%p A098945 A[1]:= {0,2,4,6,8}: B[1]:= {1}:
%p A098945 for i from 2 to 3 do
%p A098945   A[i]:= A[i-1] union map(t -> seq(x*10^(i-1)+t,x=[2,4,6,8]), A[i-1]);
%p A098945   B[i]:= B[i-1] union map(t -> seq(x*10^(i-1)+t,x=[2,4,6,8]), B[i-1]) union map(t -> 10^(i-1)+t, A[i-1] union B[i-1]);
%p A098945 od:
%p A098945 sort(convert(B[3],list)); # _Robert Israel_, May 07 2020
%t A098945 Select[Range[250],Max[Select[IntegerDigits[#],OddQ]]==1&] (* _Harvey P. Dale_, Mar 13 2022 *)
%o A098945 (Perl) for (0..1000) {
%o A098945     print "$_, " if (/^[012468]*1[012468]*$/)
%o A098945 } # _Charles R Greathouse IV_, Oct 05 2011
%K A098945 base,easy,nonn
%O A098945 1,2
%A A098945 _Eric Angelini_, Oct 21 2004