A098488 Decimal modular Gray code for n.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 10, 11, 12, 13, 14, 15, 16, 17, 18, 28, 29, 20, 21, 22, 23, 24, 25, 26, 27, 37, 38, 39, 30, 31, 32, 33, 34, 35, 36, 46, 47, 48, 49, 40, 41, 42, 43, 44, 45, 55, 56, 57, 58, 59, 50, 51, 52, 53, 54, 64, 65, 66, 67, 68, 69, 60, 61, 62
Offset: 0
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
- Martin Cohn, Affine m-ary Gray Codes, Information and Control, volume 6, 1963, pages 70-78. Example 4 column "Gray" is the present sequence.
- 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 (k) for the case all m_j=10).
- Index entries for sequences that are permutations of the natural numbers
Programs
-
Haskell
import Data.List (elemIndex); import Data.Maybe (fromJust) a098488 = fromJust . (`elemIndex` a226134_list) -- Reinhard Zumkeller, Jun 03 2013
-
Maple
# insert 10 into the second argument of the gray(.,.) function in A105530. - R. J. Mathar, Mar 10 2015
-
Mathematica
AltGray[In_] := { tIn = IntegerDigits[In]; Ac = 0; Do[tIn[[z]] = Mod[tIn[[z]] - Ac, 10]; Ac += tIn[[z]], {z, 1, Length[tIn]}]; FromDigits[tIn, 10] } -
PARI
a(n) = my(v=digits(n)); forstep(i=#v,2,-1, v[i]=(v[i]-v[i-1])%10); fromdigits(v); \\ Kevin Ryde, May 15 2020
Comments