Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097580
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097580 Base 3 representation of the concatenation of the first n numbers with the most significant digits first. +0
1
1, 110, 11120, 1200201, 121221020, 20021100110, 2022201111201, 212020020002100, 22121022020212200, 1011212101120110200001, 11101000122011021220211010, 121012010100112220022220220120 (list; graph; listen)
OFFSET

1,2

FORMULA

Consider numbers of the form 1, 12, 123, 1234, ..., N. Find the highest power of 3^p such that 3^p <= N. Then p = [log(N)/log(3)] and for 0 <= qi <= 2 [N/3^p] = q1 + r1 [r1/3^(p-1)] = q2 + r2 ........................ rp/3^1 = qp + rp+1 rp+1/3^0 = qp+1 0 For N = 1234, p = [log(1234)/log(3)] = 6 division quot rem 1234/3^6 = 1 505 505/3^5 = 2 19 19/3^4 = 0 19 19/3^3 = 0 19 19/3^2 = 2 1 1/3^1 = 0 1 1/3^0 = 1 0 The sequence of quotients, top down, form the entry in the table for 1234. Obviously this algorithm works for any N.

EXAMPLE

The 4-th concatenation of the integers > 0 is 1234. base(10,3,1234) = 1200201 the 4-th entry in the table.

CROSSREFS

Sequence in context: A109241 A090490 A135650 this_sequence A139478 A143750 A028673

Adjacent sequences: A097577 A097578 A097579 this_sequence A097581 A097582 A097583

KEYWORD

base,nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Aug 29 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research