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!)
A169821 a(n) = n*n in carryless arithmetic mod 9 in base 10. 2

%I #7 Mar 30 2012 17:38:11

%S 0,1,4,0,7,7,0,4,1,0,100,121,144,160,187,117,130,154,171,100,400,441,

%T 484,430,477,427,460,414,451,400,0,61,34,0,67,37,0,64,31,0,700,781,

%U 774,760,757,747,730,724,711,700,700,711,724,730,747,757,760,774,781,700,0,31,64

%N a(n) = n*n in carryless arithmetic mod 9 in base 10.

%C Addition and multiplication are the same as in school, that is, done in base 10, except that there are no carries and individual digits are added or multiplied mod 9.

%H <a href="/index/Ca#CARRYLESS">Index entries for sequences related to carryless arithmetic</a>

%e 13*13 = 160:

%e ..13

%e ..13

%e ----

%e ..30

%e .13.

%e ----

%e .160

%e ----

%Y Cf. A010878, A169908. See A170990 for a better version.

%K nonn,base

%O 0,3

%A _David Applegate_, _Marc LeBrun_ and _N. J. A. Sloane_, Jul 11 2010

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 April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)