# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a037909 Showing 1-1 of 1 %I A037909 #11 Oct 28 2018 04:36:10 %S A037909 0,0,0,0,0,1,0,1,0,0,0,0,1,0,1,0,0,0,0,1,0,1,0,0,0,0,1,0,1,0,0,0,0,1, %T A037909 0,1,2,1,1,1,1,1,0,1,0,0,0,1,2,1,2,1,1,0,0,1,0,1,0,0,0,0,1,0,1,0,0,0, %U A037909 0,1,0,0,1,0,0,0,0,2,1,2,1,1,1,0,1,0,1,0,0,1 %N A037909 Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*6^i is the base-6 representation of n. %H A037909 Iain Fox, Table of n, a(n) for n = 1..10000 %o A037909 (PARI) a(n) = my(c); for(i=2, #n=digits(n, 6), if(abs(n[i]-n[i-1])==1, c++)); c \\ _Iain Fox_, Oct 27 2018 %Y A037909 In base b: A037906 (b=3), A037907 (b=4), A037908 (b=5), A037910 (b=7), A037911 (b=8), A037912 (b=9), A037913 (b=10). %K A037909 nonn,base %O A037909 1,37 %A A037909 _Clark Kimberling_ # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE