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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019569 Number of bar segments in a certain way of representing the integers graphically. 0
0, 1, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 5, 4, 5, 4, 3, 5, 4, 5, 4, 4, 4, 4, 5, 5, 5, 4, 4, 5, 5, 4, 5, 4, 4, 4, 4, 6, 6, 4, 4, 5, 6, 5, 5, 5, 4, 4, 5, 5, 3, 6, 5, 5, 5, 6, 4, 5, 5, 5, 6, 4, 6, 4, 5, 5, 5, 4 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Let p(i) = i-th prime. Let n = Product_{i=1..s} p(k_i)^e_i with k_1 < k_2 < ... < k_s. The drawing of n=1 is a blank space. The drawing of n > 1 is arranged around a horizontal bar divided by s-1 scores into s segments. The scores and the bar divide the space above and below the bar into 2's compartments. In the i-th compartment above the bar place the drawing of e_i and in the i-th compartment below the bar place the drawing of k_i - k_{i-1}.

LINKS

Tyler Pierce, A way of drawing natural numbers

FORMULA

a(1) = 0; a(2) = 1; a(n) = 1 + Sum_{i=1..s} ( a(e_i) + a(k_i - k_{i-1}) ).

CROSSREFS

Sequence in context: A136510 A080071 A202472 * A003434 A097849 A100678

Adjacent sequences:  A019566 A019567 A019568 * A019570 A019571 A019572

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)

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

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

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.