|
0, 2, 6, 2, 0, 0, 2, 6, 2, 90, 110, 132, 156, 172, 190, 110, 132, 156, 172, 280, 420, 462, 406, 442, 480, 420, 462, 406, 442, 670, 930, 992, 956, 912, 970, 930, 992, 956, 912, 260, 640, 622, 606, 682, 660, 640, 622, 606, 682, 50, 550, 552, 556, 552, 550, 550, 552, 556, 552
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
PROG
|
(Python)
s, t = [int(d) for d in str(n)], [int(d) for d in str(n+1)]
l, m = len(s), len(t)
u = [0]*(l+m-1)
for i in range(l):
for j in range(m):
u[i+j] = (u[i+j] + s[i]*t[j]) % 10
return int("".join(str(d) for d in u)) # Chai Wah Wu, Jun 30 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|