login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084011 Digit reversal of 11*n, divided by 11. 1
1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 11, 21, 31, 41, 51, 61, 71, 81, 82, 2, 12, 22, 32, 42, 52, 62, 72, 73, 83, 3, 13, 23, 33, 43, 53, 63, 64, 74, 84, 4, 14, 24, 34, 44, 54, 55, 65, 75, 85, 5, 15, 25, 35, 45, 46, 56, 66, 76, 86, 6, 16, 26, 36, 37, 47, 57, 67, 77, 87, 7, 17, 27, 28, 38, 48, 58 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Indranil Ghosh, Table of n, a(n) for n = 1..9999

FORMULA

a(n) = A004086(11*n)/11. - Indranil Ghosh, Jan 10 2017

EXAMPLE

For n = 13, A004086(13*11)/11 = 341/11 = 31. So, a(13) = 31. - Indranil Ghosh, Jan 10 2017

MATHEMATICA

a[n_] := Module[{aux = IntegerDigits[11*n]}, Sum[aux[[i]]*10^(i - 1), {i, 1, Length[aux]}]/11]; Table[a[n], {n, 100}] (* José María Grau Ribas, Feb 16 2010 *)

PROG

(Python)

def A084011(n):

     return int(str(11*n)[::-1])/11 # Indranil Ghosh, Jan 10 2017

CROSSREFS

Cf. A004086, A007091.

Cf. A039691 (n such that a(n) = A004086(n)).

Sequence in context: A343750 A107603 A161594 * A345110 A004086 A121760

Adjacent sequences:  A084008 A084009 A084010 * A084012 A084013 A084014

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, May 23 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 07:57 EST 2022. Contains 358354 sequences. (Running on oeis4.)