A098488 -id:A098488 - cp's OEIS frontend

A105530 Ternary modular Gray code for n.

0, 1, 2, 5, 3, 4, 7, 8, 6, 15, 16, 17, 11, 9, 10, 13, 14, 12, 21, 22, 23, 26, 24, 25, 19, 20, 18, 45, 46, 47, 50, 48, 49, 52, 53, 51, 33, 34, 35, 29, 27, 28, 31, 32, 30, 39, 40, 41, 44, 42, 43

Offset: 0

Gary W. Adamson, Apr 11 2005

nonn

Ternary number n is converted into ternary Gray code a(n) by using the following algorithm: Leftmost term (i.e., digit) is leftmost Gray code term. Then going to the right, if next term b is greater than current term a, then (b - a) is the next Gray code term. (Gray code terms do not enter into the algorithmic operation). If next term b < a, then add 3 to b and perform [(3+b) - a] which becomes the next Gray code term. If b = a, the Gray code term = 0.
Interpreting any N-Ary code for n as N-Ary Gray code or vice versa results in a permutation of the natural numbers. Any N-Ary term can be converted to the N-Ary Gray code by using a generalization of the algorithmic rules such that if b < a, then add N to b and perform [(N + b) - a]. The other rules remain the same.
Inverse permutation of A105529.

Martin Cohn, Affine m-ary Gray Codes, Information and Control, volume 6, 1963, pages 70-78. (For the case m=3, U = P = identity matrix, v = 0 vector.)
Donald E. Knuth, The Art of Computer Programming, Pre-Fascicle 2A, Draft of Section 7.2.1.1. See subsection "Nonbinary Gray codes" page 18, and exercise 78 page 35 and answer page 54 (modular Gray g overline for the case all m_j=3).
Joseph Rosenbaum, Elementary Problem E319, American Mathematical Monthly, volume 45, number 10, December 1938, pages 694-696. (For p=3, stepping though switch position combinations by single changes.)
Index entries for sequences that are permutations of the natural numbers

Cf. A105529 (inverse), A128173 (ternary reflected), A003188 (binary), A098488 (decimal modular).

gray := proc(inp::integer,bas::integer) local resul, digs, convdigs, compl,d ; digs := [op(convert(inp,base,bas)),0] ; convdigs := [] ; for d from 1 to nops(digs)-1 do compl := op(d,digs)-op(d+1,digs) : if compl >= 0 then convdigs := [op(convdigs),compl] ; else convdigs := [op(convdigs),bas+compl] ; fi : od : convdigs := [op(convdigs),op(-1,digs)] : resul := 0 : for d from nops(convdigs) to 1 by -1 do resul := resul*bas + op(d,convdigs) : od : RETURN(resul) ; end: for n from 0 to 50 do printf("%a,",gray(n,3)) ; od : # R. J. Mathar, Mar 28 2006

a[n_] := Module[{v = IntegerDigits[n, 3]}, Do[v[[i]] = Mod[v[[i]] - v[[i-1]], 3], {i, Length[v], 2, -1}]; FromDigits[v, 3]];
Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Jun 26 2023, after Kevin Ryde *)

a(n) = my(v=digits(n,3)); forstep(i=#v,2,-1, v[i]=(v[i]-v[i-1])%3); fromdigits(v,3); \\ Kevin Ryde, May 23 2020

More terms from R. J. Mathar, Mar 28 2006

A226134 The partial digital sums of n from left to right mod 10 give the digits of a(n).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 10, 22, 23, 24, 25, 26, 27, 28, 29, 20, 21, 33, 34, 35, 36, 37, 38, 39, 30, 31, 32, 44, 45, 46, 47, 48, 49, 40, 41, 42, 43, 55, 56, 57, 58, 59, 50, 51, 52, 53, 54, 66, 67, 68, 69, 60, 61, 62, 63, 64, 65, 77, 78, 79, 70, 71, 72, 73, 74, 75, 76, 88, 89, 80, 81, 82, 83, 84, 85, 86, 87

Offset: 0

Paul Tek, May 27 2013

Inverse permutation to A098488.
Analogous to A006068 for the decimal base.
For any n, the sequence n, a(n), a(a(n)), a(a(a(n))),... is periodic.
The periods encountered between 0 and 10^6 are:
- 1 (n=0),
- 10 (n=10),
- 5 (n=20),
- 2 (n=50),
- 20 (n=100),
- 4 (n=500),
- 40 (n=10000),
- 8 (n=50000),
- 200 (n=100000),
- 25 (n=200000),
- 50 (n=200010),
- 100 (n=200100).

			1       = 1 mod 10.
1+9     = 0 mod 10.
1+9+5   = 5 mod 10.
1+9+5+4 = 9 mod 10.
Hence, a(1954)=1059.

Cf. A098488, A006068.

a226134 = foldl (\v d -> 10*v+d) 0 . scanl1 (\d x -> (x+d) `mod` 10) .
          map (read . return) . show :: Int -> Int
-- Reinhard Zumkeller, Jun 03 2013

Table[With[{idn=IntegerDigits[n]},FromDigits[Table[Mod[Total[Take[idn,i]],10],{i,Length[idn]}]]],{n,0,90}] (* Harvey P. Dale, Mar 08 2015 *)

a(n)=my(b); if(n<10, return(n), b=a(n\10); return(10*b + (b+n)%10))

a(n) = my(v=digits(n)); for(i=2,#v, v[i]=(v[i]+v[i-1])%10); fromdigits(v); \\ Kevin Ryde, May 15 2020

cp's OEIS Frontend

A105530 Ternary modular Gray code for n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Extensions

A226134 The partial digital sums of n from left to right mod 10 give the digits of a(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

PARI