Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083177
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083177 Let P(k) = floor(k/2). Start with n, apply P repeatedly until reach 1. a(n) = concatenation of numbers obtained. +0
1
1, 11, 21, 211, 311, 321, 421, 4211, 5211, 5311, 6311, 6321, 7321, 7421, 8421, 84211, 94211, 95211, 105211, 105311, 115311, 116311, 126311, 126321, 136321, 137321, 147321, 147421, 157421, 158421, 168421, 1684211, 1784211, 1794211, 1894211 (list; graph; listen)
OFFSET

1,2

FORMULA

Let P(k) = floor(k/2). Start with n, apply P repeatedly until reaching 0. a(n) = concatenation of the differences of the successive numbers obtained. - David Wasserman (wasserma(AT)spawar.navy.mil), Oct 25 2004

EXAMPLE

11 -> 5 -> 2 -> 1, hence a(11) = 6311.

11 -> 5 -> 2 -> 1 -> 0, hence a(11) = 6311.

CROSSREFS

Adjacent sequences: A083174 A083175 A083176 this_sequence A083178 A083179 A083180

Sequence in context: A094623 A034922 A015446 this_sequence A110466 A110383 A123783

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 26 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Oct 25 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research