Search: id:A134452 Results 1-1 of 1 results found. %I A134452 %S A134452 0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0, 1,0,1,0,1,0, %T A134452 1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1, 0,1,0, %U A134452 1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1, 0,1,0,1,0,1,0 %V A134452 0,1,0,1,0,-1,0,1,0,1,0,1,0,1,0,-1,0,-1,0,1,0,1,0,-1,0,1,0,1,0,1,0,1,0, 1,0,1,0,1,0,1,0, %W A134452 -1,0,-1,0,-1,0,-1,0,1,0,-1,0,-1,0,1,0,1,0,-1,0,1,0,1,0,1,0,1,0,-1,0,-1, 0,1,0,1,0,-1,0, %X A134452 1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,-1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0, 1,0,1,0,1,0,1,0 %N A134452 Balanced ternary digital root of n. %C A134452 a(A005843(n))=0; a(A134453(n))=-1; a(A134454(n))=1; ABS(a(A005408(n)))=1; %C A134452 ABS(a(n)) = A000035(n)). %D A134452 D. E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, MA, Vol 2, pp 173-175. %H A134452 R. Zumkeller, Table of n, a(n) for n = 0..10000 %H A134452 Eric Weisstein's World of Mathematics, Digital Root %H A134452 Wikipedia, Balanced Ternary %F A134452 a(n) = f(n) where f(n) = if n<-1 then f(-A065363(-n)) else (if n>1 then f(A065363(n)) else n). %e A134452 42 == '+---0' --> +1-1-2-1+0=-2 == '-+' --> -1+1=0; %e A134452 43 == '+---+' --> +1-1-2-1+1=-1; %Y A134452 Cf. A134451. %Y A134452 Sequence in context: A125122 A000035 A131734 this_sequence A071029 A071030 A073445 %Y A134452 Adjacent sequences: A134449 A134450 A134451 this_sequence A134453 A134454 A134455 %K A134452 sign %O A134452 0,1 %A A134452 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 27 2007 Search completed in 0.001 seconds