The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A037832

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Number of i such that d(i) >= d(i-1), where Sum_{i=0..m} d(i)*9^i is the base-9 representation of n.
(history; published version)

#10 by Michael De Vlieger at Sun Jul 23 18:23:30 EDT 2023

STATUS

proposed

approved

#9 by Jon E. Schoenfield at Sun Jul 23 17:10:32 EDT 2023

STATUS

editing

proposed

#8 by Jon E. Schoenfield at Sun Jul 23 17:10:26 EDT 2023

NAME

Number of i such that d(i) >= d(i-1), where Sum_{i=0..m} d(i)*9^i: i=0,1,...,m} is the base -9 representation of n.

EXTENSIONS

Sign in Name corrected. - _ by _R. J. Mathar_, Oct 16 2015

STATUS

approved

editing

#7 by R. J. Mathar at Fri Oct 16 14:05:03 EDT 2015

STATUS

editing

approved

#6 by R. J. Mathar at Fri Oct 16 13:51:59 EDT 2015

NAME

Number of i such that d(i)<>=d(i-1), where Sum{d(i)*9^i: i=0,1,...,m} is base 9 representation of n.

MAPLE

A037832 := proc(n)

a := 0 ;

dgs := convert(n, base, 9);

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

C. A037816

EXTENSIONS

Sign in Name corrected. - R. J. Mathar, Oct 16 2015

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 18:56:32 EDT 2012

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Clark Kimberling

Discussion

Fri Mar 30

18:56

OEIS Server: https://oeis.org/edit/global/285

#4 by N. J. A. Sloane at Sun Feb 20 03:00:00 EST 2005

NAME

Number of i such that d(i)<=d(i-1), where SUMSum{d(i)*9^i: i=0,1,...,m} is base 9 representation of n.

KEYWORD

nonn,base,new

#3 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003

KEYWORD

nonn,base,new

AUTHOR

Clark Kimberling, (ck6(AT)evansville.edu)

#2 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003

NAME

Number of i such that d(i)<=d(i-1), where SUM{d(i)*29^i: i=0,1,...,m} is base 9 representation of n.

KEYWORD

nonn,base,new

AUTHOR

Clark Kimberling, ck6@cedar.(AT)evansville.edu

#1 by N. J. A. Sloane at Sat Dec 11 03:00:00 EST 1999

NAME

Number of i such that d(i)<=d(i-1), where SUM{d(i)*2^i: i=0,1,...,m} is base 9 representation of n.

DATA

0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2

OFFSET

1,81

KEYWORD

nonn,base

AUTHOR

Clark Kimberling, ck6@cedar.evansville.edu

STATUS

approved