The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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 Cf. A004520, A059729. Sequence in context: A185972 A182918 A134301 * A004544 A010590 A049061 Adjacent sequences:  A168291 A168292 A168293 * A168295 A168296 A168297 KEYWORD nonn,base AUTHOR David Applegate, Marc LeBrun and N. J. A. Sloane, Jul 06 2010 STATUS approved

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

Last modified May 12 10:54 EDT 2021. Contains 343821 sequences. (Running on oeis4.)