[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Search: a037909 -id:a037909
Displaying 1-7 of 7 results found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
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
Iain Fox, Table of n, a(n) for n = 1..10000
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
In base b: A037907 (b=4), A037908 (b=5), A037909 (b=6), A037910 (b=7), A037911 (b=8), A037912 (b=9), A037913 (b=10).
KEYWORD
nonn,base
AUTHOR
Clark Kimberling
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
Iain Fox, Table of n, a(n) for n = 1..10000
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
In base b: A037906 (b=3), A037908 (b=5), A037909 (b=6), A037910 (b=7), A037911 (b=8), A037912 (b=9), A037913 (b=10).
KEYWORD
nonn,base
AUTHOR
Clark Kimberling
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
Iain Fox, Table of n, a(n) for n = 1..10000
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
In base b: A037906 (b=3), A037907 (b=4), A037909 (b=6), A037910 (b=7), A037911 (b=8), A037912 (b=9), A037913 (b=10).
KEYWORD
nonn,base
AUTHOR
Clark Kimberling
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
Iain Fox, Table of n, a(n) for n = 1..10000
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
In base b: A037906 (b=3), A037907 (b=4), A037908 (b=5), A037909 (b=6), A037911 (b=8), A037912 (b=9), A037913 (b=10).
KEYWORD
nonn,base
AUTHOR
Clark Kimberling
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
Iain Fox, Table of n, a(n) for n = 1..10000
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
In base b: A037906 (b=3), A037907 (b=4), A037908 (b=5), A037909 (b=6), A037910 (b=7), A037912 (b=9), A037913 (b=10).
KEYWORD
nonn,base
AUTHOR
Clark Kimberling
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
Iain Fox, Table of n, a(n) for n = 1..10000
PROG
(PARI) a(n) = my(c); for(i=2, #n=digits(n, 9), if(abs(n[i]-n[i-1])==1, c++)); c
CROSSREFS
In base b: A037906 (b=3), A037907 (b=4), A037908 (b=5), A037909 (b=6), A037910 (b=7), A037911 (b=8), A037913 (b=10).
KEYWORD
nonn,base
AUTHOR
Clark Kimberling
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
Iain Fox, Table of n, a(n) for n = 1..10000
PROG
(PARI) a(n) = my(c); for(i=2, #n=digits(n), if(abs(n[i]-n[i-1])==1, c++)); c
CROSSREFS
In base b: A037906 (b=3), A037907 (b=4), A037908 (b=5), A037909 (b=6), A037910 (b=7), A037911 (b=8), A037912 (b=9).
KEYWORD
nonn,base
AUTHOR
Clark Kimberling
EXTENSIONS
Offset corrected by Iain Fox, Oct 29 2018
STATUS
approved
page 1

Search completed in 0.007 seconds

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 15:03 EDT 2024. Contains 375517 sequences. (Running on oeis4.)