Search: a037909 -id:a037909
|
|
A037906
|
|
Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*3^i is the base-3 representation of n.
|
|
+10
8
|
|
|
0, 0, 1, 0, 1, 0, 1, 0, 1, 2, 1, 1, 0, 1, 1, 2, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 2, 1, 3, 2, 3, 1, 2, 1, 1, 2, 1, 1, 0, 1, 1, 2, 1, 1, 2, 1, 3, 2, 3, 1, 2, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 2, 3, 2, 2, 1, 2, 2, 3, 2, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 2, 1, 3, 2, 3, 1, 2, 1, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,10
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = my(c); for(i=2, #n=digits(n, 3), if(abs(n[i]-n[i-1])==1, c++)); c \\ Iain Fox, Oct 27 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A037907
|
|
Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*4^i is the base-4 representation of n.
|
|
+10
8
|
|
|
0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 2, 1, 1, 1, 0, 1, 0, 1, 2, 1, 2, 0, 0, 1, 0, 0, 1, 0, 0, 2, 1, 2, 1, 0, 1, 0, 1, 1, 1, 2, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 2, 1, 2, 0, 0, 1, 0, 1, 2, 1, 1, 3, 2, 3, 2, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 0, 1, 0, 1, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,17
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = my(c); for(i=2, #n=digits(n, 4), if(abs(n[i]-n[i-1])==1, c++)); c \\ Iain Fox, Oct 27 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A037908
|
|
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.
|
|
+10
8
|
|
|
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, 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, 2, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 2, 1, 2, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,26
|
|
LINKS
|
|
|
PROG
|
(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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A037910
|
|
Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*7^i is the base-7 representation of n.
|
|
+10
8
|
|
|
0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 2, 1, 2, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,50
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = my(c); for(i=2, #n=digits(n, 7), if(abs(n[i]-n[i-1])==1, c++)); c \\ Iain Fox, Oct 27 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A037911
|
|
Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*8^i is the base-8 representation of n.
|
|
+10
8
|
|
|
0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 2, 1, 2, 1, 1, 1, 1, 0, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,65
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = my(c); for(i=2, #n=digits(n, 8), if(abs(n[i]-n[i-1])==1, c++)); c \\ Iain Fox, Oct 28 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A037912
|
|
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.
|
|
+10
8
|
|
|
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, 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, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,82
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = my(c); for(i=2, #n=digits(n, 9), if(abs(n[i]-n[i-1])==1, c++)); c
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A037913
|
|
Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*10^i is the base-10 representation of n.
|
|
+10
8
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,101
|
|
LINKS
|
|
|
PROG
|
(PARI) a(n) = my(c); for(i=2, #n=digits(n), if(abs(n[i]-n[i-1])==1, c++)); c
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Offset corrected by Iain Fox, Oct 29 2018
|
|
STATUS
|
approved
|
|
|
Search completed in 0.007 seconds
|