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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A168294 Carryless product n times n+1. 7
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
David Applegate, Marc LeBrun and N. J. A. Sloane, Carryless Arithmetic (I): The Mod 10 Version.
PROG
(Python)
def A168294(n):
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
Sequence in context: A185972 A182918 A134301 * A363737 A004544 A010590
KEYWORD
nonn,base
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 March 28 05:02 EDT 2024. Contains 371235 sequences. (Running on oeis4.)