|
|
A037806
|
|
Number of i such that d(i) < d(i-1), where Sum_{i=0..m} d(i)*8^i is the base-8 representation of n.
|
|
2
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,83
|
|
LINKS
|
|
|
FORMULA
|
For 0 <= j <= 7, a(8*i+j) = a(i) + 1 if (i mod 8) < j, a(i) otherwise. - Robert Israel, May 17 2019
|
|
MAPLE
|
a := 0 ;
dgs := convert(n, base, 8);
for i from 2 to nops(dgs) do
if op(i, dgs)<op(i-1, dgs) then
a := a+1 ;
end if;
end do:
a ;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|