OFFSET
1,1
LINKS
Chris R. Rehmann, Table of n, a(n) for n = 1..10000
MAPLE
A037825 := proc(n)
a := 0 ;
dgs := convert(n, base, 10);
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
MATHEMATICA
A037825[n_] := Count[Differences[IntegerDigits[n]], _?Negative];
Array[A037825, 100] (* Paolo Xausa, Jan 26 2026 *)
PROG
(MATLAB) n = 1:10000; a = arrayfun(@(m) sum(diff(num2str(m)-'0')<0), n); % Chris R. Rehmann, Nov 23 2025
(Python)
def a(n):
d = str(n)[::-1]
return sum(1 for i in range(1, len(d)) if d[i] > d[i-1])
print([a(n) for n in range(1, 91)]) # Michael S. Branicky, Nov 23 2025
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
EXTENSIONS
Sign in name corrected by R. J. Mathar, Oct 16 2015
STATUS
approved
