|
%I #11 Oct 29 2018 02:22:09
%S 0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,
%T 0,0,0,0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,
%U 1,0,1,0,0,0,0,0,0,0,1,0,1,2,1,1,1,1,1,1,1,1
%N Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*9^i is the base-9 representation of n.
%H Iain Fox, <a href="/A037912/b037912.txt">Table of n, a(n) for n = 1..10000</a>
%o (PARI) a(n) = my(c); for(i=2, #n=digits(n, 9), if(abs(n[i]-n[i-1])==1, c++)); c
%Y In base b: A037906 (b=3), A037907 (b=4), A037908 (b=5), A037909 (b=6), A037910 (b=7), A037911 (b=8), A037913 (b=10).
%K nonn,base
%O 1,82
%A _Clark Kimberling_
|
