This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A037849 a(n) = Sum_{d(i) < d(i-1), i=1..m} (d(i-1) - d(i)), where Sum{d(i)*8^i: i=0,1,...,m} is the base-8 representation of n. 3
 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 0, 0, 0, 1, 2, 3, 4, 5, 0, 0, 0, 0, 1, 2, 3, 4, 0, 0, 0, 0, 0, 1, 2, 3, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 0, 0, 1, 2, 3, 4, 5, 6, 1, 1, 1, 2, 3, 4, 5, 6, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,11 COMMENTS This is the base-8 up-variation sequence; see A297330. - Clark Kimberling, Jan 18 2017 LINKS Clark Kimberling, Table of n, a(n) for n = 1..10000 MAPLE A037849 := proc(n)     a := 0 ;     dgs := convert(n, base, 8);     for i from 2 to nops(dgs) do         if op(i, dgs) 0 &]], {n, 1, z}];   (* A037849 *) CROSSREFS Cf. A007094, A037858, A297330. Sequence in context: A213478 A266449 A265536 * A037885 A031007 A010876 Adjacent sequences:  A037846 A037847 A037848 * A037850 A037851 A037852 KEYWORD nonn,base AUTHOR EXTENSIONS Definition swapped with A037858 by R. J. Mathar, Oct 19 2015 Updated by Clark Kimberling, Jan 19 2018 STATUS approved

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

Last modified December 8 04:46 EST 2019. Contains 329853 sequences. (Running on oeis4.)