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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001202 a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1). 1
0, 1, 10, 2, 100, 11, 20, 3, 1000, 101, 110, 12, 200, 21, 30, 4, 10000, 1001, 1010, 102, 1100, 111, 120, 13, 2000, 201, 210, 22, 300, 31, 40, 5, 100000, 10001, 10010, 1002, 10100, 1011, 1020, 103, 11000, 1101, 1110, 112, 1200, 121, 130, 14, 20000, 2001, 2010 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

T. D. Noe, Table of n, a(n) for n = 1..8192

MATHEMATICA

Clear[t]; t[1] = 0; t[n_] := t[n] = If[Mod[n, 2] == 0, t[n/2] + 1, 10*t[(n + 1)/2]]; Table[t[n], {n, 2^8}] (* T. D. Noe, Jun 26 2012 *)

PROG

(MAGMA) [n eq 1 select 0 else IsEven(n) select Self(n div 2)+1 else 10*Self((n+1) div 2): n in [1..60]]; // Bruno Berselli, Mar 07 2013

CROSSREFS

Sequence in context: A094715 A213555 A096043 * A054841 A185076 A178643

Adjacent sequences:  A001199 A001200 A001201 * A001203 A001204 A001205

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Explanation (and correction) supplied by Jay Coskey (jmc(AT)tera.com) 8/97.

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified July 31 03:18 EDT 2014. Contains 245079 sequences.