Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004489
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A004489
%S A004489 0,1,1,2,2,2,3,0,0,3,4,4,1,4,4,5,5,5,5,5,5,6,3,3,6,3,3,6,7,7,4,7,7,4,7,
%T A004489 7,8,8,8,8,8,8,8,8,8,9,6,6,0,6,6,0,6,6,9,10,10,7,1,1,7,1,1,7,10,10,11,
%U A004489 11,11,2,2,2,2,2,2,11,11,11,12,9,9,12,0,0,3,0,0,12,9,9,12,13,13,10,13
%N A004489 Table of tersums m + n (answers written in base 10).
%F A004489 Tersum m + n: write m and n in base 3 and add mod 3 with no carries, 
               e.g. 5 + 8 = "21" + "22" = "10" = 1.
%Y A004489 Similar to but different from A004481.
%Y A004489 Sequence in context: A084957 A035307 A004481 this_sequence A112599 A106795 
               A162203
%Y A004489 Adjacent sequences: A004486 A004487 A004488 this_sequence A004490 A004491 
               A004492
%K A004489 nonn,tabl,easy,nice
%O A004489 0,4
%A A004489 N. J. A. Sloane (njas(AT)research.att.com).
%E A004489 More terms from Larry Reeves (larryr(AT)acm.org), Jan 23 2001

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research