login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


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

%I #17 May 16 2020 17:11:27

%S 3,30,41,52,63,74,85,96,102,113,124,135,146,157,168,179,201,212,223,

%T 234,245,256,267,278,289,300,311,322,333,344,355,366,377,388,399,410,

%U 421,432,443,454,465,476,487,498,520,531,542,553,564,575,586,597,630

%N First (leftmost) digit - second digit + third digit - fourth digit .... = 3.

%H Amiram Eldar, <a href="/A061472/b061472.txt">Table of n, a(n) for n = 1..10000</a>

%F A225693(n) = 3. - _Robert Israel_, Jun 12 2019

%e 124 is in the sequence since 1 - 2 + 4 = 3.

%p A225693:= proc(n) local L,m,i;

%p L:= convert(n,base,10);

%p m:= nops(L);

%p add(L[i]*(-1)^(m-i),i=1..m);

%p end proc:

%p select(A225693=3, [$1..1000]); # _Robert Israel_, Jun 12 2019

%t aQ[n_] := Differences[Total @ Take[IntegerDigits[n], {#, -1, 2}] & /@ {2, 1}][[1]] == 3; Select[Range[1000], aQ] (* _Amiram Eldar_, Jun 12 2019 *)

%t Select[Range[1000],Total[Times@@@Partition[Riffle[IntegerDigits[#],{1,-1},{2,-1,2}],2]]==3&] (* _Harvey P. Dale_, May 16 2020 *)

%o (PARI) isok(n) = my(d=digits(n)); sum(k=1, #d, (-1)^(k+1)*d[k]) == 3; \\ _Michel Marcus_, Jun 12 2019

%Y Cf. A008593, A060978-A060980, A060982, A061470-A061479, A061870-A061882, A225693.

%K nonn,base,easy

%O 1,1

%A _Amarnath Murthy_, May 05 2001

%E More terms from _Robert G. Wilson v_, May 10 2001 and from Larry Reeves (larryr(AT)acm.org), May 14 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 19:55 EDT 2024. Contains 376138 sequences. (Running on oeis4.)