Search: id:A019569 Results 1-1 of 1 results found. %I A019569 %S A019569 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, %T A019569 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, %U A019569 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 %N A019569 Number of bar segments in a certain way of representing the integers graphically. %C A019569 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}. %H A019569 Tyler Pierce, A way of drawing natural numbers %F A019569 a(1) = 0; a(2) = 1; a(n) = 1 + Sum_{i=1..s} ( a(e_i) + a(k_i - k_{i-1}) ). %Y A019569 Sequence in context: A164996 A136510 A080071 this_sequence A003434 A097849 A100678 %Y A019569 Adjacent sequences: A019566 A019567 A019568 this_sequence A019570 A019571 A019572 %K A019569 nonn %O A019569 1,3 %A A019569 N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com) Search completed in 0.001 seconds