login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051022 Interpolate 0's between each pair of digits of n. 7
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 500, 501, 502, 503, 504, 505 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

These numbers have the same decimal and negadecimal representations.

Or fixed points of decimal negadecimal conversion. - Gerald Hillier, Apr 23 2015

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Eric Weisstein's World of Mathematics, Negadecimal

FORMULA

Sums a_i*100^e_i with 0 <= a_i < 10.

A051022(n) = n if n <= 10, otherwise A051022(floor(n/10))*100 + n mod 10. - Reinhard Zumkeller, Apr 20 2011

a(n) = A044836(n)/11 for n > 0. - Kritsada Moomuang, Oct 20 2019

EXAMPLE

a(23) = 203.

a(99) = 909.

a(100) = 10000.

a(101) = 10001.

a(111) = 10101.

MAPLE

M:= 3: # to get a(0) to a(10^M-1)

A:= 0:

for d from 1 to M do

  A:= seq(seq(a*100+b, b=0..9), a=A);

od:

A; # Robert Israel, Apr 23 2015

MATHEMATICA

Table[FromDigits[Riffle[IntegerDigits[n], 0]], {n, 0, 60}] (* Harvey P. Dale, Nov 17 2013 *)

ToNegaBases[i_Integer, b_Integer] := FromDigits[ Rest[ Reverse[ Mod[ NestWhileList[(#1 - Mod[ #1, b])/-b &, i, #1 != 0 &], b]]]];

k = 0; lst = {}; While[k < 1001, If[k == ToNegaBases[k, 10], AppendTo[ lst, k]]; k++]; lst (* Robert G. Wilson v, Jun 11 2014 *)

PROG

(Haskell)

a051022 n = if n < 10 then n else a051022 n' * 100 + r

            where (n', r) = divMod n 10

-- Reinhard Zumkeller, Apr 20 2011

(HP 49G calculator)

« "" + SREV 0 9

  FOR i i "" + DUP 0 + SREPL DROP

  NEXT SREV OBJ->

». Gerald Hillier, Apr 23 2015

CROSSREFS

Cf. A039723, A063010, A092908, A092909.

Sequence in context: A001633 A171120 A092907 * A218556 A043314 A088472

Adjacent sequences:  A051019 A051020 A051021 * A051023 A051024 A051025

KEYWORD

nonn,easy,base

AUTHOR

Eric W. Weisstein, Dec 11 1999

EXTENSIONS

More terms and more precise definition from Jorge Coveiro, Apr 15 2004 and David Wasserman, Feb 26 2008

Edited by N. J. A. Sloane, Sep 14 2008 at the suggestion of R. J. Mathar

Offset fixed by Reinhard Zumkeller, Apr 20 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 11 07:38 EST 2019. Contains 329914 sequences. (Running on oeis4.)