|
|
A122587
|
|
Leading digit of n in base 4.
|
|
5
|
|
|
1, 2, 3, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Digits 1, 2 and 3 appear cyclically and each time in runs whose lengths are the powers of 4.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = floor(n/(4^floor(log[4](n)))).
|
|
EXAMPLE
|
a(1) = 1/(4^0) = 1.
|
|
MAPLE
|
seq( evalf(floor(n/ (4^floor(log[4](n))))), n=1..500);
|
|
MATHEMATICA
|
Table[First[IntegerDigits[n, 4]], {n, 100}] (* Alonso del Arte, Sep 30 2011 *)
|
|
PROG
|
(Python)
def A122587(n): return int(bin(n)[2:3+(n.bit_length()&1^1)], 2) # Chai Wah Wu, Jan 30 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Peter C. Heinig (algorithms(AT)gmx.de), Oct 20 2006
|
|
STATUS
|
approved
|
|
|
|