|
Search: id:A003100
|
|
|
| A003100 |
|
Decimal Gray code for n.
(Formerly M0486)
|
|
+0
5
|
|
| 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 79, 78, 77
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Self-inverse when considered as a permutation or function, i.e. a(a(n)) = n. - Howard A. Landman (howard(AT)polyamory.org), Sep 25 2001
a(n) = A118757(n) for n<=100, = a(100)=A118757(100)=190, but a(101)=191, A118757(101)=180. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 01 2006
|
|
REFERENCES
|
A. J. Cole, Cyclic progressive number systems, Math. Gaz., 50 (1966), 122-131.
M. Gardner, Knotted Doughnuts and Other Mathematical Entertainments. Freeman, NY, 1986, p. 18.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
D. E. Knuth, Gray Codes (Vol. 4 of TAOCP)
Index entries for sequences that are permutations of the natural numbers
|
|
MAPLE
|
decgray:=proc(n) local s, i: s:=[op(convert(n, base, 10)), 0]:RETURN(add(piecewise(s[i+1] mod 2=0, s[i], 9-s[i])*10^(i-1), i=1..nops(s)-1)):end; seq(decgray(j), j=0..100); (Pab Ter)
|
|
CROSSREFS
|
Sequence in context: A092596 A118763 A098488 this_sequence A118757 A118758 A106649
Adjacent sequences: A003097 A003098 A003099 this_sequence A003101 A003102 A003103
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), H. W. Gould
|
|
EXTENSIONS
|
More terms from Pab Ter (pabrlos2(AT)yahoo.com), Oct 14 2005
|
|
|
Search completed in 0.002 seconds
|
