Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Oct 28 2018 04:36:13
%S 0,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,2,1,1,1,1,0,1,0,0,
%T 1,2,1,2,1,0,0,1,0,1,0,0,0,1,0,0,1,0,0,0,2,1,2,1,1,0,1,0,1,0,1,1,2,1,
%U 2,0,0,0,1,0,0,1,0,0,0,1,0,1,0,0,1,2,1,2,1,0
%N Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*5^i is the base-5 representation of n.
%H Iain Fox, <a href="/A037908/b037908.txt">Table of n, a(n) for n = 1..10000</a>
%o (PARI) a(n) = my(c); for(i=2, #n=digits(n, 5), if(abs(n[i]-n[i-1])==1, c++)); c \\ _Iain Fox_, Oct 27 2018
%Y In base b: A037906 (b=3), A037907 (b=4), A037909 (b=6), A037910 (b=7), A037911 (b=8), A037912 (b=9), A037913 (b=10).
%K nonn,base
%O 1,26
%A _Clark Kimberling_