The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
A037806 := proc(n)
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 ;
end proc: # R. J. Mathar, Oct 16 2015
CROSSREFS
Cf. A037823.
Sequence in context: A340945 A224898 A027360 * A038082 A107740 A016016
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
Sign in name corrected by R. J. Mathar, Oct 16 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 23:39 EDT 2024. Contains 372608 sequences. (Running on oeis4.)