cp's OEIS Frontend

A061471 First (leftmost) digit - second digit + third digit - fourth digit .... = 2.

%I A061471 #14 Mar 01 2023 15:13:35
%S A061471 2,20,31,42,53,64,75,86,97,101,112,123,134,145,156,167,178,189,200,
%T A061471 211,222,233,244,255,266,277,288,299,310,321,332,343,354,365,376,387,
%U A061471 398,420,431,442,453,464,475,486,497,530,541,552,563,574,585,596,640,651
%N A061471 First (leftmost) digit - second digit + third digit - fourth digit .... = 2.
%C A061471 a(n) == 9*(-1)^d (mod 11) if a(n) has d digits. - _Robert Israel_, Aug 05 2020
%H A061471 Robert Israel, <a href="/A061471/b061471.txt">Table of n, a(n) for n = 1..10000</a>
%p A061471 filter:= proc(n) local d,L,j;
%p A061471   L:= convert(n,base,10);
%p A061471   d:= nops(L);
%p A061471   add(L[j]*(-1)^(d-j),j=1..d)=2
%p A061471 end proc:
%p A061471 select(filter, [$1..1000]); # _Robert Israel_, Aug 05 2020
%t A061471 okQ[n_] := With[{id = IntegerDigits[n]}, id.Array[2 Mod[#, 2] - 1&, Length[id]] == 2]; Select[Range[1000], okQ] (* _Jean-François Alcover_, Nov 17 2016 *)
%t A061471 Select[Range[700],Total[Times@@@Partition[Riffle[IntegerDigits[#],{1,-1},{2,-1,2}],2]] == 2&] (* _Harvey P. Dale_, Mar 01 2023 *)
%Y A061471 Cf. A008593, A060978-A060980, A060982, A061470-A061479, A061870-A061882.
%K A061471 nonn,base,easy
%O A061471 1,1
%A A061471 _Amarnath Murthy_, May 05 2001
%E A061471 More terms from _Robert G. Wilson v_, May 10 2001 and from Larry Reeves (larryr(AT)acm.org), May 14 2001