|
| |
|
|
A004086
|
|
Read n backwards (referred to as R(n) in many sequences).
|
|
217
| |
|
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 11, 21, 31, 41, 51, 61, 71, 81, 91, 2, 12, 22, 32, 42, 52, 62, 72, 82, 92, 3, 13, 23, 33, 43, 53, 63, 73, 83, 93, 4, 14, 24, 34, 44, 54, 64, 74, 84, 94, 5, 15, 25, 35, 45, 55, 65, 75, 85, 95, 6, 16, 26, 36, 46, 56, 66, 76, 86, 96, 7, 17, 27, 37, 47
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Also called digit reversal of n.
For n>0: a(a(n)) = n iff n mod 10 > 0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 10 2002
|
|
|
LINKS
| Franklin T. Adams-Watters, Table of n, a(n) for n = 0..1000
|
|
|
FORMULA
| a(n) = d(n,0) with d(n,r) = if n=0 then r else d(floor(n/10),r*10+(n mod 10)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 04 2010]
|
|
|
MAPLE
| read transforms; A004086 := digrev; #cf "Transforms" link at bottom of page
A004086:=proc(n) local s, t; if n<10 then n else s:=irem(n, 10, 't'); while t>9 do s:=s*10+irem(t, 10, 't') od: s*10+t fi end; # [From M. F. Hasler, Jan 29 2012]
|
|
|
MATHEMATICA
| Table[FromDigits[Reverse[IntegerDigits[n]]], {n, 0, 75}]
|
|
|
PROG
| (PARI) Contribution from Michael Porter (michael_b_porter(AT)yahoo.com), Oct 16 2009: (Start)
digits(n) = {local(m=n, r=[]); while(m>0, r=concat(m%10, r); m=floor(m/10)); r}
A004086(n) = {local(b, m, r); r=0; b=1; m=digits(n); for(i=1, matsize(m)[2], r=r+b*m[i]; b=b*10); r} (End
)
(PARI) A004086(n)=eval(concat(vecextract(Vec(Str(n)), "-1..1"))) \\ [From M. F. Hasler, Nov 11 2010]
(Haskell)
a004086 = read . reverse . show -- Reinhard Zumkeller, Apr 11 2011
|
|
|
CROSSREFS
| Cf. A188649.
Cf. A030101 - A030108.
Sequence in context: A107603 A161594 A084011 * A121760 A061816 A083960
Adjacent sequences: A004083 A004084 A004085 * A004087 A004088 A004089
|
|
|
KEYWORD
| nonn,base,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 30 2004
|
| |
|
|
