OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
101 is a term because "101" ends in "1" = 1 + 0;
112 is a term because "112" ends in "2" = 1 + 1;
1132 is a term because "1132" ends in "2" = 1 + 1; etc.
MAPLE
S[3]:= [seq(seq(100*i + 10*j + (i+j), j=0..9-i), i=1..9), 910];
g:= proc(t, k) local a, b, j;
b:= t mod 10;
a:= (t-b)/10;
seq(a*10^(k+1) + 10*j + b, j=0..10^k-1)
end proc:
S[4]:= map(g, S[3], 1):
map(op, [S[3], S[4]]); # Robert Israel, Jan 13 2026
MATHEMATICA
q[n_] := Module[{d = IntegerDigits[n], s, ds, nds}, s = Plus @@ d[[1 ;; 2]]; ds = IntegerDigits[s]; nds = Length[ds]; ds == d[[-nds ;; -1]]]; Select[Range[10, 1140], q] (* Amiram Eldar, Mar 16 2022 *)
Select[Range[100, 1200], Total[Take[IntegerDigits[#], 2]]==Mod[#, 10]||Total[Take[IntegerDigits[#], 2]]==Mod[#, 100]&] (* Harvey P. Dale, Mar 29 2024 *)
PROG
(Python)
def ok(n):
s = str(n)
return n > 9 and s.endswith(str(int(s[0])+int(s[1])))
print([k for k in range(1140) if ok(k)]) # Michael S. Branicky, Mar 16 2022
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Eric Angelini and Carole Dubois, Mar 16 2022
STATUS
approved
