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.

A143712 Numbers with at least two digits in which all digits except the rightmost are even and the rightmost is odd.

This page as a plain text file.
%I A143712 #24 Aug 06 2022 18:54:48
%S A143712 21,23,25,27,29,41,43,45,47,49,61,63,65,67,69,81,83,85,87,89,201,203,
%T A143712 205,207,209,221,223,225,227,229,241,243,245,247,249,261,263,265,267,
%U A143712 269,281,283,285,287,289,401,403,405,407,409,421,423,425,427,429,441,443,445,447
%N A143712 Numbers with at least two digits in which all digits except the rightmost are even and the rightmost is odd.
%C A143712 These are called e-type numbers, cf. A163396.
%H A143712 Harvey P. Dale, <a href="/A143712/b143712.txt">Table of n, a(n) for n = 1..1000</a>
%H A143712 <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>
%t A143712 Select[Range[21, 500], (id = IntegerDigits[#1]; And @@ EvenQ /@ Most[id] && OddQ[Last[id]]) & ] (* _Jean-François Alcover_, May 23 2013 *)
%t A143712 eodQ[n_]:=Module[{td=TakeDrop[IntegerDigits[n],-1]},OddQ[td[[1,1]]]&&AllTrue[ td[[2]],EvenQ]]; Select[Range[10,500],eodQ] (* _Harvey P. Dale_, Aug 06 2022 *)
%Y A143712 Cf. A144162, A163396, A169984.
%K A143712 nonn,base
%O A143712 1,1
%A A143712 _David Applegate_, _Marc LeBrun_ and _N. J. A. Sloane_, Aug 24 2010