%I A097151
%S A097151 0,1,2,3,4,5,1,4,1,3,1,2,1,1,1,0,1,1,1,2,1,3,1,4,1,5,2,4,2,3,2,2,2,1,2,
0,2,1,
%T A097151 2,2,2,3,2,4,2,5,3,4,3,3,3,2,3,1,3,0,3,1,3,2,3,3,3,4,3,5,4,4,4,3,4,2,4,
1,4,0,
%U A097151 4,1,4,2,4,3,4,4,4,5,5,1,4,5,1,3,5,1,2,5,1,1,5,1,0,5,1,1,5,1,2,5,1,3,5,
1
%V A097151 0,1,2,3,4,-5,1,-4,1,-3,1,-2,1,-1,1,0,1,1,1,2,1,3,1,4,1,-5,2,-4,2,-3,2,
-2,2,-1,2,0,2,1,
%W A097151 2,2,2,3,2,4,2,-5,3,-4,3,-3,3,-2,3,-1,3,0,3,1,3,2,3,3,3,4,3,-5,4,-4,4,
-3,4,-2,4,-1,4,0,
%X A097151 4,1,4,2,4,3,4,4,4,-5,-5,1,-4,-5,1,-3,-5,1,-2,-5,1,-1,-5,1,0,-5,1,1,-5,
1,2,-5,1,3,-5,1
%N A097151 Digits of balanced base-10 representations of nonnegative integers (least
significant digits first).
%C A097151 Definition 9.1.2. of the Crandall-Pomerance book is: "The balanced base-B
representation of a nonnegative integer x is the shortest sequence
of integer digits (x_i) such that each digit satisfies -floor(B/2)
<= x_i <= floor((B-1)/2) and x = sum(i=0,D-1,x_i*B^i)." (I have replaced
floor and sigma symbols with "floor" and "sum" for inclusion here.)
The D digits x_0, x_1, x_2, ..., x_(D-1) are included in this order
in this sequence and in the opposite order in A097150.
%D A097151 R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective,
Springer, NY, 2001; see p. 408.
%e A097151 As the only digits permissible are in {-5,-4,-3,-2,-1,0,1,2,3,4},
%e A097151 5 = -5 + 1*10 is the first number requiring two of these digits: -5,1.
%e A097151 A097150 is the same sequence but with the digits in reverse order.
%e A097151 Also, 45 = -5 - 5*10 + 1*10^2 has digits -5,-5,1,
%e A097151 54 = 4 - 5*10 + 1*10^2 has digits 4,-5,1 and
%e A097151 55 = -5 - 4*10 + 1*10^2 has digits -5,-4,1.
%Y A097151 Cf. A097150 (most significant digits first).
%Y A097151 Sequence in context: A053827 A033926 A050269 this_sequence A071500 A071516
A026284
%Y A097151 Adjacent sequences: A097148 A097149 A097150 this_sequence A097152 A097153
A097154
%K A097151 base,easy,sign
%O A097151 1,3
%A A097151 Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jul 27 2004
|